UNIVERSITY OF ENGINEERING AND TECHNOLOGY,

JJ TAXILA

NAME: Farwa Sheikh

Reg. No: 21-CP-o4
SECTION: Omega

Department of Computer Engineering

EXPERIMENT #5
MINIMIZATION OF A BOOLEAN FUNCTION.

Goals:
To simplify the given expression and to realize it using Basic gates and Universal gates
Pre-laboratory:
• Familiar with the procedural steps in setting up ICs on breadboard and verifying truth table of
various gates
• Familiar with the procedural steps in implementation of NAND gate as the universal gate

Equipment:
• Breadboard.
• Connecting wires.
• IC 7400 x 2
• IC 7408, IC 7432 x1
 IC 7406

Discussion:
Boolean algebra is a mathematical system with two values (zero and one) and three operators:
logical AND, logical OR, and logical NOT. The Boolean system is closed with respect to these
three operations; that is, these operators always produce a Boolean result given Boolean
operands. Logical AND and OR are commutative; you can switch the operands and get identical
results
Question 1:
Reduce the Following Boolean Expression using K -MAP and implement it on trainer
board.
Y = XZ’ + (Y + Y’Z) + XY

TRUTH TABLE:

X Y Z XY XZ’ Y’Z XZ’ +

(Y +
Y’Z) +
XY
0 0 0 0 0 0 0
0 0 1 0 0 1 1
0 1 0 0 0 0 1
0 1 1 0 0 0 1
1 0 0 0 1 0 1
1 0 1 0 1 1 1
1 1 0 1 0 0 1
1 1 1 1 0 0 1

Reduction (using k-map)

00 01 11 10

0 0 1 1 1

1 1 1 1 1

Simplified expression = X+ Y+ Z
SIMULATION:

Reduce the Following Boolean Expression using above theorems and implement it on
trainer board.

ABC’D’+ABC’D+AB’C’D+ABCD+AB’CD+ABCD’+AB’CD’
 Truth table:

Reduction(using k-map)

00 01 11 10
CD
AB
00 0 0 0 0

01 0 0 0 0

11 1 1 1 1

10 0 1 1 1

Simplified result: AB + AC + AD

SIMULATION: