| Input | Output | |
| A | B | Y |
| 1 | 1 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 0 | 0 | 1 |
A) NOT gate
B) OR gate
C) XOR gate
D) NAND gate
Correct Answer: D
Solution :
The given truth table follows a ?NAND? gate whose output is 1 only if at least one of its inputs is zero. Its Boolean expression is \[Y=\overline{A\ .\,\,B}\] \[so\,that\overline{1\ .\,\,1}=\,\overline{1}=0\] \[\overline{0\,.\,\,1}=\,\overline{0}=1\] \[\overline{1\,.\,0}=\,\overline{0}=1\] \[\overline{0\,.\,0}=\,\overline{0}=1\] Note: NAND gate is called as universal of digital building block because by the repeated use of NAND gates we can perform all the logic functions like OR, AND, etc.
You need to login to perform this action.
You will be redirected in
3 sec
