Q.Explain the universal property of NAND gate and realize the AND, OR, NOT and X-OR gates with their respective truth tables.
[!TLDR]
NAND is universal: NOT, AND, OR and X-OR can all be realised with NAND gates only.
Universal property: A gate is called universal if the three basic gates (NOT, AND, OR) can be constructed from it alone — and hence any logic function. The NAND gate satisfies this, so any digital circuit can be built entirely from NAND gates. This is economical because only one type of IC need be stocked.
1) NOT gate — tie both NAND inputs together: .
| A | Y = Ā |
|---|---|
| 0 | 1 |
| 1 | 0 |
2) AND gate — a NAND followed by a NAND-inverter: (2 NANDs).
| A | B | Y = AB |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
3) OR gate — invert both inputs with NAND-inverters, then NAND them: (3 NANDs, by De Morgan).
| A | B | Y = A+B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
4) X-OR gate — four NANDs: ; ; ; .
| A | B | Y = A⊕B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
[!ANSWER]
NAND is universal because NOT , AND , OR and X-OR are all realisable with NAND gates alone, each verified by the truth tables above.
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.