The truth table given below is -A and B are the inputs- Y is the output-A B Y0 0 10 1 11 0 11 1 0ANDXORNORNAND

Question

Toppr Admin · Accepted Answer

-xA0-A-xA0-B-xA0-Y-xAF-Y-xA0-00-xA0-10-xA0-xA0-01-xA0-xA0-10-xA0-xA0-10-xA0-xA0-10-xA0-xA0-11-xA0-01-xA0-We can observe from the table that -xAF-Y-A-B-x21D2-Y-xAF-xAF-xAF-xAF-xAF-xAF-xAF-xAF-ABSo- the table represents a NAND gate-

$A$	$B$	$Y$	$¯ Y$
0	0	1	0
0	1	1	0
1	0	1	0
1	1	0	1

A	B	C	D
$0$	$0$
$1$	$0$
$0$	$1$
$1$	$1$

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
AND
XOR
NOR
NAND

$A$ $B$ $Y$ $¯ Y$
0 0 1 0
0 1 1 0
1 0 1 0
1 1 0 1
We can observe from the table that $¯ Y = A . B \Rightarrow Y = ¯ ¯¯¯¯¯¯ ¯ A B$
So, the table represents a NAND gate.

The truth table given below is for (A and B are the inputs, Y is the output)A B Y0 0 10 1 11 0 11 1 0ANDXORNORNAND

A B Y¯Y 00 10 01 10 10 10 11 01 We can observe from the table that ¯Y=A.B⇒Y=¯¯¯¯¯¯¯¯ABSo, the table represents a NAND gate.

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
AND
XOR
NOR
NAND

$A$ $B$ $Y$ $¯ Y$
0 0 1 0
0 1 1 0
1 0 1 0
1 1 0 1
We can observe from the table that $¯ Y = A . B \Rightarrow Y = ¯ ¯¯¯¯¯¯ ¯ A B$
So, the table represents a NAND gate.