Register

UGC NET CSE | June 2007 | Part 2 | Question: 9

Redirected
• edited by
1,231 views

2 Answers

5 votes
5 votes
Given that $A \oplus B = C$

$(A)A \oplus C \\ \equiv A \oplus(A \oplus B)\\ \equiv(A \oplus A) \oplus B\\ \equiv 0 \oplus B\\ \equiv B$

Option (A) is true.

$(B)B \oplus C \\ \equiv B \oplus(A \oplus B) \\ \equiv B \oplus ( B \oplus A)\\ \equiv (B \oplus B )\oplus A\\ \equiv 0 \oplus A\\ \equiv A$
Option(B)is true.

$(C)A \oplus B \oplus C \\ \equiv A \oplus B \oplus(A \oplus B) \\ \equiv A \oplus B \oplus ( B \oplus A)\\ \equiv A \oplus(B \oplus B )\oplus A\\ \equiv A \oplus 0 \oplus A\\ \equiv A \oplus A\\ \equiv 0$

Option(C)is false.

(D)from (C) option(D) is true.

 
Hence,Option(A),(B) and (D)are true.
User Avatar
0 votes
0 votes
Option D is correct.

Putting the value of A $\oplus$ B in option D, we get C $\oplus$ C $=$ $0$
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
478 views
UGC NET CSE | June 2007 | Part 2 | Question: 1
The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
User Avatar
0 votes
0 votes
0 answers
2
go_editor asked Mar 28, 2020
709 views
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is: $\text{A B C D E F}$ $\text{A B D E F C}$ $\text{A C E B D F}$ None of the above
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
User Avatar
0 votes
0 votes
0 answers
3
go_editor asked Mar 28, 2020
1,162 views
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
1 votes
1 votes
1 answer
4
go_editor asked Mar 28, 2020
1,277 views
UGC NET CSE | June 2007 | Part 2 | Question: 4
The regular expression given below describes: $r=(1+01)$*$(0+\lambda)$ Set of all string not containing $’11’$ Set of all string not containing $’00’$ Set of all string containing $’01’$ Set of all string ending in $’0’$
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all stri...
User Avatar
Link Copied!