1

Name: Alaan, Angelica B.

Atienza, Raymond Angelo M.
Monteiro, Franchesca Date Perform: 10/10/21
Course: COE 3-1 Date Submitted: 10/12/21

Experiment No. 2

BOOLEAN ALGEBRA AND SIMPLIFICATION OF LOGIC EQUATIONS

I. OBJECTIVES

1. To simplify the Boolean expression and to build the logic circuit.

2. Given a Truth table to derive the Boolean expressions and build the logic circuit to
realize it.

II. MATERIALS

− IC Type 7400 Quadruple 2-input NAND gate

− IC Type 7404 Hex Inverter
− IC Type 7432 Quadruple 2-input OR gate
− LED’s

III. THEORY

The English mathematician George Boole (1815-1864) sought to give symbolic form to
Aristotle‘s system of logic. Boole wrote a treatise on the subject in 1854, titled An Investigation
of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and
Probabilities, which codified several rules of relationship between mathematical quantities limited
to one of two possible values: true or false, 1 or 0. His mathematical system became known as
Boolean algebra. All arithmetic operations performed with Boolean quantities have but one of two
possible.

Boolean algebra is a deductive mathematical system closed over the values zero and one
(false and true). A binary operator defined over this set of values accepts a pair of boolean inputs
and produces a single boolean value.

The Boolean laws and rules are shown below;

Laws:
1. A+B=B+A
A.B=B.A
2. A + (B + C) = (A + B) + C
A . (B . C) = (A . B) . C
3. A . (B + C) = A . B + A . C
Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo
 2

(A + B).(C + D) = A.C + A.D + B.C + B.D

Rules:
1. A . 0 = 0 6. A . A’ = 0
2. A . 1 = A 7. A + A = 1
3. A + 0 = A 8. A = A
4. A + 1 = 1 9. a) A + A’ . B = A + B
5. A . A = A b) A’ + A . B = A’ + B
10. A + A = A

IV. PROCEDURES

For all ICs in this experiment: Vcc = +5v to pin 14, and 0(ground) to pin 7.

For each part of the experiment, wire the logic diagram as shown. Make the voltage
measurements at the points indicated complete the tables.

As you perform the experiment, for every output on the logic diagram express the Boolean
function in terms of the input variables and write it on the diagram.

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 3

1. Figure 2.1 Table 2.1

5V
A x y
0 1 0
A 1 3 4 1 0 1
2 y
x

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 4

2. Figure 2.2 Table 2.2

5V A x y
0 0 1
1 1 0
A 1 2 3 4 5 6 y
x

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 5

3. Figure 2.3 Table 2.3

VCC
5V
A x
0 0
A 1
3
1 1
x
2

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 6

4. Figure 2.4 Table 2.4

VCC
5V A x
0 1
A 1 x 1 1
2 3

1 2

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 7

Table 2.5
5. Figure 2.5

VCC A B x y
5V 0 0 1 0
0 1 1 0
A 1 0 1 0
1 1 0 1
1 x y
2
B 3 1
2

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 8

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 9

6. Figure 2.6 Table 2.6

VCC
A x y
5V 0 1 0
1 0 1
1
x y
3 1 2
2

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 10

7. Figure 2.7

VCC A x y
5V 0 1 0
1 1 0
1
x y
1 2
3
2

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 11

8. Figure 2.8 Table 2.8

VCC A B x y
5V 1 0 0 0 0
3 x 0 1 1 1
2
A 1 1 0 1 1
3 3
1 2 1 1 1 1
4
2
B 4 6
5 y

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 12

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 13

V. DISCUSSION QUESTION:

1. Express the Boolean equations between inputs and output in Table 2.1a for each part
of the experiment. Use letter inputs and output where they are used.

Table 2-1a
Part Boolean Equation
1 y = A’’
2 y = A’’’
3 y=A+A
4 x = A + A’
5 y = (AB)''
6 y = (AA)’’
7 y = (AA')''
8 x = A+ (A'B)''

2. Simplify the Boolean expression Y= A’B’CD’ + A’BCD’ + ABCD’ + AB’CD’

AB’C’D’ + AB’C’D + AB’CD

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 14

3. Consider the circuit as shown in Figure 2.9. The objective is to apply simplification
procedure to reduce the number of gates.

Figure 2.9
a. Test the circuit by obtaining its truth table, Table 2-1b.

Table 2-1b
Truth Table for Figure 2.9

INPUT OUTPUT
A B C Y
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

b. Obtain the Boolean equation of the circuit.

( (AB'C')' (A'BC)' (AC)' )'

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 15

c. Simplify the equation using the Boolean algebra.

( (AB'C')' (A'BC)' (AC)' )'

d. Draw the simplified logic circuit.

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo

 16

VI. CONCLUSION

We therefore conclude that simplifying logic equations can be one of the tedious
tasks yet rewarding thing to do when designing circuits. A simplified circuit will
always have fewer logic components, which decreases an insane amount of money
from hardware, it reduces the heat generated by the chip, which mean they consume
lesser power and most importantly they are faster as compared to its original form.
Without simplification, our modern day gadgets would happen to be too costly and
too complex to build, thus it would be inefficient.

Engr. Pablo B. Asi Engr. Leni A. Bulan Engr. Liza R. Maderazo