MSA University
CS121 Digital Logic Design
Lab Manual
1
Table of contents:
Lab 3: Simplifying complicated formulas...............................................................2
Lab 4: Simplifying complicated formulas (cont.)....................................................3
1
Lab 3: Simplifying complicated formulas
Objectives:
The purpose of the lab is to use the Boolean Algebra axioms and theories
taught in the course to simplify complicated formula into simplified ones with
minimum number of terms and literals.
Experiment requirements:
This experiment uses the following TTL level ICs; the pin configurations
for these ICs are available in appendix A:
1 - 7404 hex inverter
1 - 7408 quad 2-input AND gate
1 - 7432 quad 2-input OR gate
Procedure:
1- Implement the following function using logic gates:
F=X + XY + X Z +X YZ
Get the truth table of the function. Write it down in the results part.
2- Simplify the previous function into minimum number of literals, implement it
using logic gates, and then verify the truth table of the previous step.
2
Pre-lab activity:
1. Write down the truth table of the function:
F=X + XY + X Z +X YZ
X Y Z F
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
2. Simplify the function into minimum number of literals. Write all the steps
clearly
3. Sketch the logic diagram of both the function F before and after the
simplification.
1
Lab 4: Simplifying complicated formulas (cont.)
Objectives:
The purpose of the third lab is to use the Boolean algebra axioms and
theories taught in the course to simplify complicated formula into simplified ones
with minimum number of terms and literals
Experiment requirements:
This experiment uses the following TTL level ICs; the pin configurations
for these ICs are available in appendix A:
1 7404 hex inverter
1 7408 quad 2-input AND gate
2 7432 quad 2-input OR gate
Procedure:
1- Implement the following function using logic gates:
F=( A+C )( A +C )( A +B+C D )
Get the truth table of the function. Write it down in the results part.
2- Simplify the previous function to only 4 literals, implement it using logic gates,
and then verify the truth table of the previous step.
2
Pre-lab activity:
1. Write down the truth table of the function:
F=( A+C )( A +C )( A +B+C D )
A B C D F
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
2. Simplify the function into minimum number of literals. Write all the steps
clearly.
3
3. Sketch the logic diagram of both the function F before and after the
simplification.
