APPARATUS REQUIRED
i) NAND gate
ii) Bread board
iii)) Ic chips
iv) Power supply
v) LED
vi) Connecting wires
vii) Resistance
THEORY
The logic circuit of a 2-input AND gate connected to a NOT gate gives rise to a NAND gate, NOT, AND and OR gate are called basic gates. The three basic gates can be constructed with the help of NOR and NAND gates. So they fall under the Universal gate. That’s why gate are building blocks of other gates.
X – OR and X-NOR are called arithmetic gates as there we include arithmetic operations. Demorgan’s Law are rules which play a vital role in reaching to boolean expression.
NAND gates as
OBSERVATION:
1 as high input, 0 as low input. Indicator as show when output is high
NAND gate as NOT gate
| A | y= Ā |
| 0 | 1 |
| 1 | 0 |
NAND gate as AND gate
| A | ρ | y= Aρ |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
NAND gate as OR gate
| A | B | y= Aρ |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
NAND as NOR gate
| A | B | y |
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 0 |
RESULT
NAND as a Universal gate is verified by using the truth table.
CONCLUSION
We can verify NAND and Universal gates by Ic chips.
PRECAUTION
i) Join the clear circuits appropriately.
ii) Check + and – of source.
iii) Check the connections property.