DLD LAB 6
Implementation of NAND and NOR Gates
Objective:
To study and implement the basic universal logic gate (NAND gate), verify its operation, and
demonstrate how NOT, AND, and OR gates can be made using only NAND gates. Also to implement
and verify the equation F = X + Ȳ·Z using NOR gates.
Introduction:
Logic gates are the fundamental parts of all digital circuits. NAND and NOR are called universal gates
because we can make any logic circuit using only these two. In this experiment, we will use NAND
gates to form NOT, AND, and OR gates and then use NOR gates to design the equation F = X + Ȳ·Z.
This helps us understand the universality of these gates in logic design.
Implementation of NAND Gate:
1. NOT Gate
A NOT gate can be made using a single NAND gate. When both inputs of a NAND gate are connected
together, it inverts the input signal. If input is 0, output becomes 1 and vice versa.
Truth Table:
Input (A) Output (Y = Aʹ)
0 1
1 0
2. AND Gate
An AND gate can be made by connecting the output of a NAND gate to a NOT gate. First, the NAND
gate gives output (A·B)ʹ and then a NOT gate inverts it to get A·B.
Truth Table:
A B Output (Y = A·B)
0 0 0
0 1 0
1 0 0
1 1 1
3:OR Gate
To form an OR gate using NAND, first connect both inputs to separate NAND gates acting as NOT
gates, and then connect their outputs to another NAND gate. This combination gives the same result as
OR.
Truth Table:
A B Output (Y = A + B)
0 0 0
0 1 1
1 0 1
1 1 1
Procedure:
1. Connect the NAND gate IC (7400) on the breadboard.
2. Give power supply of +5V to pin 14 and GND to pin 7.
3. For NOT gate, short both inputs together.
4. For AND and OR gates, connect gates as explained in the circuit diagram.
5. Use switches for inputs and LED with resistor for output.
6. Observe output for all input combinations.
7. Repeat the same using NOR gate IC (7402) to verify the equation F = X + Ȳ·Z.
Implementation of NOR Gate:
In this part, we implement the logic equation F = X + Ȳ·Z using NOR gates. NOR gates are also
universal gates and can be used to form NOT, AND, and OR gates. This experiment helps to understand
their working and practical use.
Truth Table for F = X + Ȳ·Z:
X Y Z Output (F = X +
Ȳ·Z)
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Diagram
Ic Connection:
In this circuit, two 7400 NAND ICs are used to implement . On the first IC, pins 1 and 2 are shorted and
used as input , making this NAND gate function as an inverter. Its output at pin 3 is , which is connected
to pin 4 of the same IC. Pin 5 of the first IC receives input , and the output from this gate (pin 6)
produces , which is fed into the second IC. On the second IC, pins 12 and 13 are shorted and connected
to pin 6 of the first IC, acting as an inverter. Its output at pin 11 is connected to pins 9 and 10 (also
shorted), whose output at pin 8 goes back to pin 5 of the first IC. Additionally, on the second IC, pins 1
and 2 are shorted to serve as input , and the output from pin 3 is connected to pin 4 of the first IC. The
final output of the entire configuration is taken from pin 6 of the first IC, giving the desired function .
Output Result:
Conclusion:
This lab verified that both NAND and NOR gates are universal gates. Using NAND, we made NOT,
AND, and OR gates, and with NOR, we implemented F = X + Ȳ·Z. The outputs matched the expected
truth tables, confirming correct working.