Sir Syed CASE Institute of Technology, Islamabad

EE2401 Digital Logic Design

Lab No. 3

Name of Student: Roll No. :

Date of Experiment: Report submitted on:

Marks obtained: Instructor’s Signature:

Instructor: Engr Safdar Munir

Implementation Of Boolean Expression Through Logic Gates & Also Verification
of Demorgan’s Law And Absorption Theorem.

Apparatus:
 Logic Trainer
 Connecting Wires
 Power Supply
 14 pin ICs [ AND, OR, NOT]

Theory:
Boolean algebra is an algebra that deals with binary variables and logic operations. A
Boolean function described by an algebraic expression consists of binary variables, the
constants 0 and 1, and the logic operations symbols. For a given value of the binary
variables, the function can be equal to either 1 or 0.

Procedure:
Consider as an example for the following Boolean function:

F1 = x + y`z

The function F1 is equal to 1 if x is equal to 1 or if both y` and z are equal to 1, F 1 is equal to 0

otherwise. The complement operation dictates that when y`=1 then y=0. Therefore, we can say
that F1=1 if x=1 or if y=0 and z=1. A Boolean function expresses the logical expression for all
possible values of the variables.

A Boolean function can be represented in a truth table. A truth table is a lot of combinations of
1’s and 0’s assigned to the binary variables and a column that shows the value of the function for
each binary combination. The number of rows in the truth table is 2n, where n is the number of
variables in the function. The binary combinations for the truth table are obtained from binary
numbers by counting from 0 through 2n-1. The following table shows the truth table for the
function F1.
Truth Table for F1
x y z F1
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Table 4.1: Truth table for F1

Digital Logic Design Lab (EE-2401) 2

 Figure 4.1: Gate implementation of F1=x+y`z

Experiment Work 1

Reducing a given Boolean function

By manipulating a Boolean expression according to Boolean algebra rules, it is sometimes

possible to obtain a simpler expression for the same function and thus reduce the number of
gates in the circuit and the number of inputs to the gate.
Obtain the reduced expression for the Boolean function given below.
F2= x`y`z + x`yz +xy`
Draw the logic diagram for the reduced function F2 and construct the circuit on breadboard.
Apply input signals and record your output F2 in Table 4.2

x y z F2
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Table 4.2: Truth Table for F2
Experiment Work 2
Verify Demorgan’s Theorem
Demorgan’s law can be stated in terms of logic terms, which is the 1st law states that,
(x+y)`= x`.y`
And the second law state that
(x.y)`= x`+ y`
Truth Table that verifies the above given 1st law,

x y (x+y)` x`. y`
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0

Table 4.3: Truth Table of (x+y) `=x`.y`

Logic Diagram for 1st Demorgan’s Law:

Digital Logic Design Lab (EE-2401) 3

 Figure 4.2: Logic Diagram of (x+y)`=x`.y`

Draw the logic diagram for the Demorgan’s 2nd Law. Construct the circuit on breadboard
and record your observations in Truth Table 4.4

x y (x.y)/ x/ + y/
0 0
0 1
1 0
1 1

Table 4.4: Truth Table that verifies the Demorgan’s 2nd Law (x.y)/=x/+y/

Experiment Work 3.
Verification of two forms of Absorption Theorem i.e.
a) Form1: A + (A.B) = A
b) Form2: A.(A + B) = A
i. Draw logic diagram of Form1 of Absorption Theorem. Construct its circuit on breadboard and record
your observations in Table 4.5
Input Output

A B A.B A + (A.B) = A

0 0

0 1

1 0

1 1

Table 4.5 Form1 of Absorption Theorem A + (A.B) = A

Digital Logic Design Lab (EE-2401) 4

ii. Draw logic diagram of Form2 of Absorption Theorem. Construct its circuit on breadboard and record
your observations in Table 4.6

Input Output

A B A+B A. (A + B) = A

0 0

1 1

1 0

1 1

Table 4.6 Form2 of Absorption Theorem: A + (A.B) = A

Digital Logic Design Lab (EE-2401) 5