Logic Gates
AND Gate NAND Gate XOR Gate
OR Gate NOR Gate XNOR Gate
BUFFER Gate NOT Gate SUMMARY
AND Gate
If both of the INPUT is high then the OUTPUT is high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 0
A Y=A.B 0 1 0
1 0 0
B 1 1 1
OR Gate
If at least one of the INPUT is high then the OUTPUT
is high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 0
A Y=A+B 0 1 1
1 0 1
B 1 1 1
NOT Gate
If INPUT is high then the OUTPUT is low .If INPUT is
low then the OUTPUT is high.
TRUTH TABLE
INPUT OUTPUT
A Y=A A Y
0 1
1 0
BUFFER Gate
If INPUT is high then the OUTPUT is high .If INPUT is
low then the OUTPUT is low.
TRUTH TABLE
INPUT OUTPUT
A Y=A A Y
0 0
1 1
NAND Gate
If at least one of the INPUT is low then the OUTPUT
is high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 1
A Y=A.B 0 1 1
1 0 1
B 1 1 0
NOR Gate
If both of the INPUTs are low then the OUTPUT is
high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 1
A Y=A+B 0 1 0
1 0 0
B 1 1 0
XOR Gate
If all the INPUTs aren’t equal then the OUTPUT is
high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 0
A Y=A+B 0 1 1
1 0 1
B 1 1 0
XNOR Gate
If all the INPUTs are equal then the OUTPUT is high.
TRUTH TABLE
INPUT OUTP
UT
A B Y
0 0 1
A Y=A+B 0 1 0
1 0 0
B 1 1 1
SUMMARY
AND Gate NAND Gate XOR Gate
Y=A.B Y=A.B Y=A+B
OR Gate NOR Gate XNOR Gate
Y=A+B Y=A+B Y=A+B
BUFFER Gate NOT Gate
Y=A Y=A
Where A & B are INPUTs
and Y is OUTPUT.
THE END
Designed by Rasika