Lab 2 Universal Logic Gates
Lab 2 Universal Logic Gates
Lab 2 Universal Logic Gates
A. Objectives
B. Apparatus
• Trainer Board
• IC 7400 Quadruple 2-input NAND gates
• IC 7402 Quadruple 2-input NOR gates
C. Theory
A universal gate is a gate which can implement any Boolean function without need to use any other gate
type. The NAND and NOR gates are universal gates. In practice, this is advantageous since NAND and NOR
gates are economical and easier to fabricate and are the basic gates used in all IC digital logic families.
Figure C1 shows the implementation of NOT, AND & OR gates using only NAND gates.
D. Procedure
1. Verify each of the NAND gate equivalent circuits in Figure C1 to perform the same operations of the
basic gates.
2. Design, construct and test the implementations of XOR and XNOR gates using NAND gates only. Show
the circuits in Figure F1 (Section F), clearly labeling the pin numbers.
3. Design, construct and test the implementations of NOT, AND, OR, XOR and XNOR gates using NOR
gates only. Show the circuits in Figure F2 (Section F), clearly labeling the pin numbers.
Page 1 of 4
Department of Electrical and Computer Engineering EEE / ETE 211: Digital Logic Design
4. Complete the truth table for the circuit in Figure D2 in Table F1 (Section F).
5. Convert the circuit in Figure D2 to a NAND gate equivalent circuit, showing the steps involved and clearly
labeling the pin numbers in the final circuit design. Show your work in Figure F3 (Section F).
(i) Part 1 - Replace each of the gates with its NAND gate equivalent.
(ii) Part 2 - Identify any inversions that are compensated (i.e. one inverter followed by another) in part
1 and redraw the final circuit in part 2.
6. Validate the operation of the universal gate circuit from the truth table.
E. Report
2. Simulate the circuit in Figure F3 – Step 2 using Logisim. Provide a screenshot of the Logisim circuit
schematic and truth table with your report.
Page 2 of 4
Department of Electrical and Computer Engineering EEE / ETE 211: Digital Logic Design
F. Experimental Data
XOR XNOR
NOT AND OR
XOR XNOR
Figure F2: Implementation of NOT, AND, OR, XOR and XNOR using NOR gates
A B C I1 = AC I2 = BC’ F = I1 + I2
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Part 1
Part 2
Page 4 of 4