Department of Aviation Engineering Technology

Superior University

Digital Techniques
AT-2226

Experiment No.5
Verification of theorems of Boolean Algebra

Prepared for

By:

Name:

ID:

Section:

Semester:

Total Marks:

Obtained Marks:

Signature:

Date:
 Digital Techniques Lab 5
Verification of theorems of Boolean Algebra
Objective:

To verify theorems of Boolean algebra through Logic Gates

Equipment:
1. Digital Logic Trainer
2. IC 7408, IC 7432, IC 7404
3. Connecting wires

Theory:
Digital Logic Gates function is represented by a function table or a truth table that Digital Logic
describes all the Logic gate outputs for every possible combination of inputs. As the logic gates
operate on binary values therefore these function tables describe the relationship between the input
and output in terms of binary values. The function of a logic gate is also described in terms of an
expression.

The basic Laws of Boolean Algebra that relate to the Commutative Law allowing a change in
position for addition and multiplication, the Associative Law allowing the removal of brackets for
addition and multiplication, as well as the distributive Law allowing the factoring of an expression,
are the same as in ordinary algebra.

Each of the Boolean Laws above are given with just a single or two variables, but the number of
variables defined by a single law is not limited to this as there can be an infinite number of variables
as inputs too the expression. These Boolean laws detailed above can be used to prove any given
Boolean expression as well as for simplifying complicated digital circuits.

27
Task # 1
De morgan’s Law:

Expression 1:

(X+Y)’=X’. Y’

This can be proof by the use of truth table.

L.H.S
Circuit Diagram:

x
(X + (X + Y)
Y)
y

Figure 5.1 Logical Circuit

Truth table:

Table 5.1: Truth Table

Inputs Outputs

X Y X+Y (X+Y)’

0 0

0 1

1 0

1 1

R.H.S
Circuit Diagram:

x X

X .Y

y Y

Figure 5.2: Logic Circuit

Truth table:

Table 5.2: Truth Table

Inputs Outputs

X Y X’ Y’ X’.Y’

0 0

0 1

1 0

1 1

Expression 2 :

(X.Y)’=X’+Y’

This can be proof by the use of truth table.

L.H.S
Circuit Diagram:

X
(X.Y) (X.Y)

Y
Figure 5.3: Logic circuit

Truth table:

Table 5.3: Truth Table

Inputs Outputs

X Y X.Y (X.Y)’

0 0

0 1

1 0

1 1
R.H.S
Circuit Diagram:

x X

X+Y

y Y

Figure 5.4:Logic circuit

Table 5.4: Truth table

Inputs Outputs

X Y X’ Y’ X’+Y’

0 0

0 1

1 0

1 1

Task # 2

Absorption theorem:

Expression 1:

X + (X.Y) = X

1. Verify absorption theorem

2. Show your results to the lab instructor
L.H.S
Circuit Diagram:

X
X + (X.Y)

X.Y
Y

Figure 5.5: Logic circuit

Truth table:

Table 5.5:Truth table

Inputs Outputs

X Y Observed

0 0

0 1

1 0

1 1

Expression 2:

X . (X +Y) = X

1. Verify absorption theorem

2. Show your results to the lab instructor
L.H.S
Circuit Diagram:

X X.
(X+Y)

X+
Y
Y
Figure 5.6: Logic circuit

Truth table:

Table 5.6: Truth table

Inputs Outputs

X Y Observed

0 0

0 1

1 0

1 1

Procedure:
1. Insert the IC 74xx on the trainer’s breadboard.
2. Use any two Logic Switches (S2 to S9) of the trainer for Input and any one of the LEDs (L0 to
L15) of the trainer for Output indication.
3. Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
4. By setting various combinations of the two switches verify that the output of the gate is in
accordance with the Truth Table shown above.
5. Record your observation.
 Conclusion:

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

______________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

________________________________________________________________________________________________________________________________________________

____________________________________