Verify NAND Gate as a Universal Gate Using IC Chips

Codynn
2 Min Read

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

Ay= Ā
01
10

NAND gate as AND gate

Aρy= Aρ
000
010
100
111

NAND gate as OR gate

ABy= Aρ
000
011
101
111

NAND as NOR gate

ABy
001
010
100
110

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.

Share This Article
Leave a comment

Leave a Reply

Your email address will not be published. Required fields are marked *