retagged by
11,782 views

4 Answers

Best answer
34 votes
34 votes
  1. $XOR$ is associative so $(x \oplus y) \oplus z = x \oplus (y \oplus z)$
  2. For $2$ input, XOR and XNOR are complement to each other i.e. $x \oplus y = (xy + x^{'}y^{'})^{'} $
  3. $x \oplus y = x+y \text{ if }xy = 0$

Only false statement is option B.

edited by
12 votes
12 votes

$A. \:(x \oplus y) \oplus z = x \oplus (y \oplus z)$

$\Longrightarrow EX-OR$ and $EX-NOR$  $GATE$ are Commutative and associative.

$\Longrightarrow NAND$ and $NOR$  $GATE$ are commutative but not associative.

$B.\:(x + y) \oplus z = x \oplus (y+z)$

$LHS:(x + y) \oplus z=(x+y)z'+(x+y)'z=xz'+yz'+x'.y'.z$

$RHS:x \oplus (y+z)=x(y+z)'+x'(y+z)=x.y'.z'+x'y+x'z$

Clearly $LHS\neq RHS$

So, this is not valid.

$C.\:x \oplus y = x+y, \text{if}\: xy=0$

           It is like $Q\:\text{if}\:P$ means $\text{if}\: P\:\text{then}\:Q$     

              We can write in ${\color{Magenta}{P\rightarrow Q} }$

Now     if ${\color{Red} {xy=0}},$ then ${\color{Green} {x \oplus y = x+y}}$                          

$x$ $y$ $xy$ $x\oplus y$ $x+y$
$0$ $0$ ${\color{Red} 0}$ ${\color{Green} 0}$ ${\color{Green} 0}$
$0$ $1$ ${\color{Red} 0}$ ${\color{Green} 1}$ ${\color{Green} 1}$
$1$ $0$ ${\color{Red} 0}$ ${\color{Green} 1}$ ${\color{Green} 1}$
$1$ $1$ $1$ $0$ $1$

                                    ${\color{Orange}{(OR)}}$ 

if ${\color{Red} {xy=0}},$ then ${\color{Green} {x \oplus y = x+y}}$  

We know that ${\color{DarkBlue}{x\oplus y=xy'+x'y}}={\color{Orange}{(x\odot y)'}}={\color{Green}{(xy+x'y')'}}={\color{Green} {(0+x'y')'}}={\color{Magenta}{x+y}}$ 

$D.\:{\color{Purple}{x \oplus y = (xy+x’y’)’}}$  

So, the correct answer is $(B).$

edited by
5 votes
5 votes
Checking option A = XOR is associative so this is valid.

Checking option C =

     xy=0 means x=y' .

     so x XOR y = x'y +xy' = (y')' y + x x = x+y

     so option c is valid.

Checking option D = (xy + x'y')' = (xy)' (x'y')' = (x'+y')(x+y) = x'x + x'y +y'x +y'y = x XOR y so option D is valid.

Checking option B = Remaining only option B is the ans and by expanding we can check it's not valid.
2 votes
2 votes

option C is true by truth table 

X Y X ex-or Y x+y xy
0 0 0 0 0
0 1 1 1 0
1 0 1 1 0
1 1 0 1 1

option A says associativity of ex-or,(so true),

option D is true because complement of ex-nor is ex-or(for even variables),

so answer is option B.

 

Answer:

Related questions

19 votes
19 votes
4 answers
1
Arjun asked Feb 7, 2019
11,151 views
In $16$-bit $2$’s complement representation, the decimal number $-28$ is:$1111 \: 1111 \: 0001 \: 1100$$0000 \: 0000 \: 1110 \: 0100$$1111 \: 1111 \: 1110 \: 0100$$1000...
19 votes
19 votes
5 answers
2
Arjun asked Feb 7, 2019
13,609 views
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a...
35 votes
35 votes
9 answers
3