The following circuit represents: [AIPMT 1999] |
A) OR gate
B) XOR gate
C) AND gate
D) NAND gate
Correct Answer: B
Solution :
Output of upper AND gate \[=\overline{A}B\] |
Output of lower AND gate \[=A\overline{B}\] |
Thus, output of OR gate \[=\overline{A}B+A\overline{B}\] |
This is Boolean expression for XOR gate. |
Note: XOR operation employed in XOR gate is called mod-2 addition and rules of addition are |
\[0\oplus 0=0;\] \[0\oplus 1=1;\] |
\[1\oplus 0=1;\] \[1\oplus 1=0\] |
You need to login to perform this action.
You will be redirected in
3 sec