Professional Documents
Culture Documents
Lab 3
Universal Gates
OBJECTIVES
After completing this experiment, you will be able to:
• Determine the truth tables for universal gates (NAND and NOR).
• Use universal gates (NAND and NOR) to formulate other basic logic gates and
demonstrate the equivalence between them.
COMPONENTS REQUIRED
• 7400 quad 2-input NAND gate
• 7402 quad 2-input NOR gate
PROCEDURE
Part-1
• Look up the connection diagram for the 7400 quad 2-input NAND gate and the
7402 quad 2-input NOR gate. Note that there are four gates on each of these
ICs. Apply Vcc and ground to the appropriate pins.
• Then test one of the NAND gates by connecting all possible combination of
inputs as listed in Table 3-1. Apply a logic 1 through a series 1 kΩ resistor and a
logic 0 by connecting directly to ground. Show the logic output as well as the
measured output voltage for each case, and include both in Table 3-1.
5v Power Regulator
Table 3-3
IN 1 OUT (NAND) OUT (NOR)
0 1 1 ✓
1 0 0 ✓
NAND Gate
NOR Gate
• Build the circuit of the figure 3.2 to verify working as AND gate and complete
the truth table 3-4
Figure 3.2
Table 3-4
IN 1 IN 2 OUT (NAND) OUT (NOR)
0 0 0 0 ✓
0 1 0 0 ✓
1 0 0 0 ✓
1 1 1 1 ✓
Verifying Truth Table
NAND Gate
Verifying Truth Table:
NOR Gate
• Repeat the previous step for functionality of universal gates as OR gate and
complete the truth table 3-5.
Figure 3.3
Table 3-5
IN 1 IN 2 OUT (NAND) OUT (NOR)
0 0 0 0 ✓
0 1 1 1 ✓
1 0 1 1 ✓
1 1 1 1 ✓
NAND Gate
NOR Gate
REVIEW QUESTIONS
• What do you mean by Universal gates? How will you implement any logic
circuit using universal gates?
- It is a logic gate that can execute any Boolean function without utilizing another
logic gate. The NOR and NAND gates are universal gates. And it indicates that
you can construct any logical Boolean statement using only NAND or NOR
gates. Universal Gates can be implement in any logic circuit such that AND gate,
OR, and Not gate. In addition,
Implementation of any logic circuit (AND gate) using universal gates shown below:
Truth Table:
A B AB
0 0 0 ✓
0 1 0 ✓
1 0 0 ✓
1 1 1 ✓
Verifying Truth Table:
2. AND Gate using NOR Gate
Truth Table:
A B AB
0 0 0 ✓
0 1 0 ✓
1 0 0 ✓
1 1 1 ✓
Verifying Truth Table
3. OR gate using NAND gate
Truth Table
A B A+B
0 0 0 ✓
0 1 1 ✓
1 0 1 ✓
1 1 1 ✓
IN 1 IN 2 OUT (XNOR)
0 0 1 ✓
0 1 0 ✓
1 0 0 ✓
1 1 1 ✓
VERIFYING TRUTH TABLE:
XNOR Gate using NOR Gates
IN 1 IN 2 OUT (XNOR)
0 0 1 ✓
0 1 0 ✓
1 0 0 ✓
1 1 1 ✓
VERIFYING TRUTH TABLE:
• Implement NAND using NOR gates.
IN 1 IN 2 OUT (NAND)
0 0 1 ✓
0 1 1 ✓
1 0 1 ✓
1 1 0 ✓
VERIFYING TRUTH TABLE: