Experiment 4

BOOLEAN ALGEBRA

Name: Philip Luis DM. Aquino Section: EEE - 31

Professor: Leonila Elemento Date: 20 / 10 / 2021

DURATIONS: 3 Hours

OBJECTIVES:

1. To check the theorems of Boolean algebra in practical approach.

2. To simplify the logic equations using theorems in Boolean algebra.

BACKGROUND:

Boolean algebra is the special language of digital circuits, a mathematical

method of expressing, analyzing and designing logic circuits. It is similar in many ways
to conventional algebra, but it is simpler and has several pertinent differences. It is easy
to learn and extremely useful. It is most essential to the proper understanding and
application of digital circuits.

Boolean algebra is a simplified mathematical system used to deal with binary or

two value functions. It permits us to express all of the various logic functions, both
simple and complex, in a convenient mathematical format. This system gives us a
method of understanding and designing digital logic circuits.

The basic Boolean reducing equations are represented below.

A ·1 = A

A ·0 = 0

A ·A = A

A ·Ā = 0

A + 1 =1

A + 0 =A

A + A =A

A+Ā=1

A=A

41
MATERIALS/EQUIPMENT:

7400 NAND - 1 piece

7402 NOR - 1 piece
7404 Hex Inverter - 1 piece
7408 AND - 1 piece
7432 OR - 1 piece
Breadboard - 1 piece
Power Supply - 1 set
Frequency Generator - 1 set
Oscilloscope - 1 set
Connecting Wires

PROCEDURE:

Part 1: Double Inversion

a. Connect the two inverter logic in series as shown in Figure 4.1.

INPUT OUTPUT

U1:A U1:B
1 2 3 4

7404 7404

Figure 4.1: Double Inversion

b. Supply the Input terminal of Double Inversion circuit with the logical
combination presented in Table 4.1. Using a VOM, measure the equivalent
voltage of each logical combination. Record your data in Table 4.1.

Note: Voltages ranging from +2.5V to +5V will denote logic 1 (HIGH) and 0V
to 1V denote logic 0 (LOW).

42
 Table 4.1: Double Inversion
Input (A) Output (X)
0 0
1 1

c. Turn ON the function generator and set its parameter to:

Frequency: 1KHz Amplitude: 5Vpp

Signal : Square Wave Duty Ratio: 50%

Note: Use an oscilloscope to measure the waveform.

d. Connect the probe of function generator to the Input terminal of Double

Inversion circuit.

e. Using oscilloscope, display the input and output waveforms of Double

Inversion circuit. Note, the set-up must be looked like as shown in Figure 4.2.
Remember that there should be common grounds, that is, the negative
probes of generator, oscilloscope, and circuit must be all shorted.

INPUT OUTPUT
A
+
B

U1:A U1:B C
-
AM FM 1 2 3 4
D

7404 7404

Figure 4.2: Waveforms in Double Inversion

43
f. Draw your input and output waveforms on the space provided below.

Input Waveform

Output Waveform

44
g. Base on your gathered data, derive the Boolean equation of Double inversion
circuit and place it in the space provided below.
Double complement (A’)’ = A
(A+A’)A = A

h. How much time it took for the Double Inversion circuit to sink an output
waveform?
500 us

i. Modify the circuit shown in figure 4.2 to form a quadruple inversion or four
inverters in series

45
j. Measure the latency of the circuit by comparing the input signal in the output
signal. Draw your gathered data in the space provided below.
Input Waveform

Output Waveform

46
 Part 2: Absorption Theorem

a. Construct the AND-OR Combinational circuit shown in Figure 4.3.

A B X

U2:A
1
3
2

7408 U1:A
1
3
2

7432

Figure 4.3: AND-OR Combinational Circuit

b. Determine the logical Output of AND-OR Combinational circuit for each

logical Input combination shown in Table 4.2. Record your answers in
Table 4.2.

Table 4.2: AND-OR Combinational Circuit

A (Input) B (Input) X (Output)

0 0 0
0 1 0
1 0 1
1 1 1

c. Derive the Boolean equation based from your gathered data in Table 4.2.
Max terms (0 and 1) – Min terms (3 and 4)
AB’ + AB = A
From that
A (B’+B) = A
A+AB = A

47
d. Construct the OR-AND Combinational circuit shown in Figure 4.4.

A B C

U2:A
1
3
2

7408
U1:A
1
3
2

7432

Figure 4.4.OR-AND Combinational Circuit

e. Determine the logical Output of OR-AND Combinational circuit for each

logical Input combination shown in Table 4.3. Record your answers in Table
4.3.

Table 4.3: OR-AND Combinational Circuit

A (Input) B (Input) X (Output)

0 0 0
0 1 1
1 0 0
1 1 1

f. Derive the Boolean equation based from your gathered data in Table 4.3.

Max values is (0 and 2) – Min terms (1 and 3)

A’B + AB = B

Then from that simplify

B+BA = B

48
 Part 3: Distributive Law

a. Construct the circuit shown in Figure 4.5.

A B C X

U1:A
1
3
2

7432

U2:A
1
3
2

7408
U1:B
4
6
5

7432

Figure 4.5: Distributive Law (Demo1)

b. Determine the logical Output of the given circuit shown in Figure 4.5 for
logical Input combination shown in Table 4.4. Record your answers in
Table 4.4.

Table 4.4: Distributive Law (Demo 1)

A B C X (Output)
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

49
 c. Derive the Boolean equation based from your gathered data in Table 4.3.

Max terms (0, 2, and 4) and Min term (1, 3, 5, 6, and 7)

A’B’C + A’BC + AB’C + ABC’ + ABC

From that simplify

C + AB = (C+A) (C+B)

Construct the circuit shown in Figure 4.6.

A B C X

U2:A
1
3
2

74ALS32

U1:A
1
3
2

7408

Figure 4.6: Distributive Law (Demo 2)

b. Determine the logical Output of the given circuit shown in Figure 4.6 for logical
Input combination shown in Table 4.5. Record your answers in Table 4.5.

Table 4.5: Distributive Law (Demo 2)

A B C X (Output)
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

50
c. Derive the Boolean equation based from your gathered data in Table 4.3.
Max terms (1, 3, 5, 6, and 7) and Min term (0, 2, and 4)
A’B’C + A’BC + AB’C + ABC’ + ABC
From that simplify

C + AB = (C+A) (C+B)

51
 Part 4: Self Assessment

1. Simplify the given equation shown below using Boolean Algebra and draw the equivalent
logic circuit.

X=ABC+ABC+ABC+ABC+ABC

Simplified form X = A’ B’ C’

2. Show all the possible input and output combinations (Truth Table) of the simplified logic
equation of number 1.

A B C F
0 0 0 1
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 0

52
 Part 5: Exercises

1. Construct an actual circuit to verify the operation of the expression given in number 1 in
the Self-Assessment in Part 4.

53
SUMMARY:

The experiment showed the application of Boolean algebra in the logic circuit. Boolean
algebra is a branch of mathematics that deals with operations on logical values with
binary variables. The Boolean variables are represented as binary numbers to represent
“High” and “Low”. In part 1: Double Inversion it showed double complement, whatever
value was assigned it will result to it because it was inverted 2x and 4x in the
experiment.

Part 2: Absorption Theorem, Absorption law involves in linking of a pair of binary

operations. Using AND-OR and OR-AND combination gate this theorem was showed.
The operation used was as said earlier AND and OR gate, the inputs A and B was
combined in terms that one will be ANDed to the other one and the output will be ORed
to the other input and vice versa.

Part 3: Distributive Law, This is the most used and most important law in Boolean
algebra, which involves in 2 operators: AND, OR. The multiplication of two variables and
adding the result with a variable will result in same value as multiplication of addition of
the variable with individual variables. In other words, ANDing two variables and ORing
the result with another variable is equal to AND of ORing of the variable with the two
individual variables and the other way around.

CONCLUSION:

In conclusion, in many applications of Boolean algebra, you have to reduce a particular

expression to its simplest from or change its form to a more convenient one to implement the
expression most efficiently. The approach taken in the lab is to use the basic laws, rules, and
theorems of Boolean algebra to manipulate and simplify an expression. The basic rules and
laws of both Boolean algebra are used to reduce a given expression to a simplified form so that
the number of gates are minimized to as far as possible to produce the same output.

54
RECOMMENDATION:

Putting the negative/common probe of the function generator after the resistor and not
after the LED near the ground so the Multism won’t have a reading error.

REFERENCES:

 Mano, M. (2001). Logic and Computer Design Fundamentals. 3rd ed. Singapore:
Pearson Education, Asia.

 Bartee, T. (2004). Computer Architecture and Logic Design. New Jersey: John Wiley &
Sons.
 Conclusion. (2021, March 22). Gettysburg College.
https://eng.libretexts.org/@go/page/26951
 Kenton, W. (2020). Boolean Algebra. Investopedia. Retrieved from:
https://www.investopedia.com/business-leaders-4689830

55