The truth table given below is for (A and B are the inputs, Y is the output)
A | B | Y |
0 | 0 | 1 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
NOR
AND
XOR
NAND
D.
NAND
The NAND gate is an AND gate followed by a NOT gate. If inputs A and B are both '1' the output Y is not '1'. The gate gets its name from this NOT AND behaviour.
This is a logical symbol.
The output Y is a combination of AND + NOT gate. Hence, the truth table is for NAND gate.