Name: Hernandez, Jeus Linbert M. ; Cantos, Roldan A.

Course: BSEE Date Submitted: 11/27/2020

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
− Breadboard
− Connecting wires
− Power Supply
− 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
(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.
1. Figure 2.1
A x y

0 0 1

1 1 0
2. Figure 2.2
A x y

0 1 0

1 0 1
3. Figure 2.3

A x

0 1

1 0
4. Figure 2.4

A x

0 1

1 1
5. Figure 2.5
A B x y

0 0 0 1

0 1 1 0

1 0 1 0

1 1 1 0
6. Figure 2.6
A x y

0 0 1

1 1 0
7. Figure 2.7
A x y

0 1 0

1 1 0
8. Figure 2.8
A B x y

0 0 1 1

0 1 1 0

1 0 0 1

1 1 0 0
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.

Part Boolean Equation

1 x=A’
y=x’

2 x=A
y=x’

3 x=A+A
x=A

4 x=A+A’
x=1

5 x=(A+B)’
y=x’

6 x=(A+A’) ; x=A’
y=x’

7 x=(AA’)’ ;x=A’+A; x=1

y=x’

8 x=A+((A’B)’)’ ; x=A+A’B; x=A+B

y=A+B

Table 2-1a
2. Simplify the Boolean expression Y= A’B’CD’ + A’BCD’ + ABCD’ + AB’CD’ AB’C’D’ +
AB’C’D + AB’CD

Y =A’B’CD’ + A’BCD’ + ABCD’ + AB’CD’ + AB’C’D’ + AB’C’D + AB’CD

Y = A’B’CD’ + BCD’(A’+A) + AB’C(D’+D) + AB’C’(D’+D)
Y = A’B’CD’ + BCD’ + AB’C + AB’C’
Y = CD’(A’B’+B) + AB’(C+C’)
Y = AB’ + A’CD’ + BCD’

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.

Y=[(AB’C’)’(A’BC)’(AC)’]’
c. Simplify the equation using the Boolean algebra.

Y=[(AB’C’)’(A’BC)’(AC)’]’
Y = [(A’+B+C) (A+B’+C’) (A’+C’)]’
Y = (A’+B+C)’+ (A+B’+C’)’+ (A’+C’)’
Y = AB’C’+ A’BC +AC
Y= A(B’C’+C) + A’BC
Y = AB’+ AC + A’BC
Y=AB’+ C(A+A’B)
Y = AB’+ AC + BC

d. Draw the simplified logic circuit.

 VI. CONCLUSION

There is no simple method to tell whether the simplified expression is in its simplest form
or whether it might have been rearranged further. Hence, it frequently turns into a cycle of
experimentation. While examining a logic circuit, determining the Boolean expression of the
yield and its relating truth table is needed. The Boolean expression for the necessary circuit
can be got from the truth table. Once the expression for a logic circuit has been gotten, we
may be able to reduce it to an easier structure containing less terms or less factors in at least
one terms. The new expression would then be able to be utilized to execute a circuit that is
comparable to the first circuit however that contains less gates and also connections. Hence,
the utilization of Boolean expressions in simplifying logic equations is important in logic
circuit design.
SCREENSHOTS

We made the second experiment by dividing the task into two. Cantos would be
responsible in the Procedures part of the experiment, involving Multism. And I, Hernandez,
would be responsible on the discussion questions and in our Conclusion, and also on editing
our overall output. We both contributed to the success of the experiment.