Logic gates represented using Boolean algebra
-
AND Gate:
- Boolean Expression: Q = A · B
- Truth Table:
A B Q 0 0 0 0 1 0 1 0 0 1 1 1
-
OR Gate:
- Boolean Expression: Q = A + B
- Truth Table:
A B Q 0 0 0 0 1 1 1 0 1 1 1 1
-
NOT Gate (Inverter):
- Boolean Expression: Q = ~A
- Truth Table:
A Q 0 1 1 0
-
NAND Gate (AND with NOT):
- Boolean Expression: Q = ~(A · B)
- Truth Table:
A B Q 0 0 1 0 1 1 1 0 1 1 1 0
-
NOR Gate (OR with NOT):
- Boolean Expression: Q = ~(A + B)
- Truth Table:
A B Q 0 0 1 0 1 0 1 0 0 1 1 0
-
XOR Gate (Exclusive OR):
- Boolean Expression: Q = A ⊕ B
- Truth Table:
A B Q 0 0 0 0 1 1 1 0 1 1 1 0
-
XNOR Gate (Exclusive NOR):
- Boolean Expression: Q = ~(A ⊕ B)
- Truth Table:
A B Q 0 0 1 0 1 0 1 0 0 1 1 1