Lab 5
Lab 5
I. Objectives
The objective of this lab is to introduce students to Boolean algebra reduction techniques
and how to build multilevel logic circuits.
II. Pre-requisite
Please watch the following video to prepare for this lab:
Universal gates
III. Preparations
2. Obtain logic diagrams of the following functions using only 2-input NAND gates:
a. F(X,Y,Z) = (X.Y.Z) + (Y.Z’)+(X.Z’)
b. G(A,B,C) = (A +C’) ∙ (B’+C)
For each of the above functions, construct the truth table.
3. Obtain logic diagrams of the following functions using only 2-input NOR gates:
a. F(A,B,C) = (A’+C) ∙ (A +B )
b. G(X,Y,Z) = X.Z +Y∙ Z’
Page 1 of 2
Dr. Rami Alazrai
German-Jordanian University
School of Electrical Engineering and Information Technology
Department of Computer Engineering
4. Obtain logic diagram for a 3-input OR gate using only 2-input NAND gates (Hint:
use the Boolean algebra theorems to build the logic circuit).
5. Obtain logic diagram for a 3-input AND gate using only 2-input NOR gates (Hint:
use the Boolean algebra theorems to build the logic circuit).
V. Lab work
Page 2 of 2
Dr. Rami Alazrai