Course: CpE203-CpE22S3 Section: CpE22S3

Name: Caringal Group Date Performed: Feb 22, 2023

Instructor: Mrs. Mindoro Date Submitted: Feb 22, 2023

LABORATORY EXPERIMENT NO.2

BOOLEAN ALGEBRA THEOREMS

1. Objective(s):

The activity aims to know the Boolean function and the different forms of it.

2. Intended Learning Outcomes (ILOs):

The students shall be able to:

1. Construct a simplified circuit in Mutisim using Logic Gates.
2. Utilize Boolean algebra laws and rules for simplifying logic circuits.
3. Discussion:

Boolean Algebra
The Term Boolean Algebra honors a fascinating English mathematician; George Boole, is intended
to perform a mathematical analysis of logic. It is used for two-valued logic that is present on any digital
system. It uses mathematical notation for representing function of digital circuitry which allows variables and
constant to have only two possible values.

Like algebra in mathematics which governs certain rules and theorems for every expression, we may assume
that any variable may range through entire field of real numbers. However variables in Boolean
algebra may only take two and only two possible values. These values may be represented by either 1 or 0. If
an equation describing logical circuitry contains several variables, it is still understood that each of the
variables can assume only the values of 1 and 0.

Boolean Algebra Laws and Rules

Boolean algebra uses many of the same laws as those of ordinary algebra. The following three laws are the
same for Boolean algebra as they are for ordinary algebra:
1. Commutative law of addition: A + B = B + A and multiplication: AB = BA. These laws mean that the
order of ORing or ANDing does not matter.

2. Associative law of addition: A + (B+ C) = (A + B) + C and multiplication: A (BC) = (AB)C These laws
mean that the grouping of several variables ORed or ANDed together does not matter.

3. Distributive law: A (B+C) = AB + C and (A + B) (C + D) = AC + AD + BC + BD. These laws show

methods for expanding an equation containing ORs and ANDs.

1
The table below contains the basic of the theorems of Boolean algebra that assume to be used again and
again later.
Table 3.1 Boolean Algebra Theorems
EQUATION No. BOOLEAN EQUATION DESCRIPTION
1 X+Y=Y+X
Commutative Property
XY = YX
X + (Y + Z) = (X + Y) + Z
2 Associative Property
X(YZ) = (XY)Z
X X =X .
3 Idempotent Property
X+X=X
X 1=X .
4 X+1=1
X 0=0 . Identity Property

5 Null Property
X+0=X
X (Y + Z) = XY + XZ
6 Distributive Property
(XY) + (XZ) = X + YZ

7
.
X X’ = 0
Negation Property
X + X’ = 1
8 (X’)’ = X Double Negation Property
9 X + XY = X Absorption Property

The following example illustrates the use of the first Boolean rule, which states that anything ANDed with a 0
will always output a 0.

Rule 1: Anything ANDed with a 0 is equal to 0 (A 0 = 0).

Rule 2: Anything ANDed with a 1 is equal to itself (A 1 = A).

Rule 3: Anything ORed with a 0 is equal to itself (A + 0 = A).

Rule 4: Anything ORed with a 1 is equal to 1 (A + 1 = 1).

Rule 5: Anything ANDed with itself is equal to itself (A A = A).

2
 Rule 6: Anything ORed with itself is equal to itself (A + A = A).

Rule 7: Anything ANDed with its own complement equals 0.

Rule 8: Anything ORed with its own complement equals 1.

Rule 9: A variable that is complemented twice will return to its original logic level.

Rule 10: A + AB = A + B A + AB = A + B. Using Truth Table to Prove the Equations.

4. Resources:

1 Set Computer with Multisim

5. Procedure and Output

1. Construct the circuit in figure 2.1 below on your Multisim. Take note of the number assigned inside the
logic gate symbols. This denotes the IC number package designation for each IC that you will use. The
number outside the IC indicates the PIN of IC. Refer to the IC pin configuration.

3
 Figure 2.1: Logic Gate of Y

2. Write the equivalent Logic equation of the circuit on figure 2.1.

Y(XW) = ((XW)+(XW’)) + (X’W)

3. Change the value of the inputs w and x to 0 or 1 and write your answer in Table 2.1.
4. From the obtain logic equation on procedure no. 2, simplify the equation to obtain the same equation
obtain on procedure no. 5. Show your step-by-step solutions.
((XW)+(XW’)) + (X’W) - distributive
(X(W+W’)) + (X’W) – negation
X(1) + X’W – absorption
= X+W

5. Write the equivalent Logic equation of the circuit on figure 3.2.

6. Place the screenshot of your work below:

7. Construct Circuit 2.2 on your prototyping board. 4

Figure 2.2: Simplified Logic Gate of Y

8. Change the value of the inputs w and x to 0 or 0 and write your answer on the table below.
Table 3.1: Logic Gate of Y
 INPUT OUTPUT
W X Y on Fig. 2.1 Y on Fig. 2.2
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1

9. Remove all components and circuit connections of the previous diagram.

10. On your Multisim construct the given circuit (SPDT for the switch)

Figure 2.3: Logic Gate of Z

11. Write the equivalent Logic equation of the circuit on figure 2.3.
((A+B’)(B+C))B

12. Change the value of the inputs A, B and C and write your answer in the Table 2.2.
13. Simplify the given equation using Boolean algebra. Show your step-by-step solutions below and obtain
the same result on procedure no. 9.
((A + B’)(B + C))B
(AB + AC + B’B + B’C)B - negation
(AB + AC + (0) + B’C)B - distributive
(ABB + ACB + B’CB) - idempotent
AB + ACB + B’CB – negation/ distributive/null
AB(1 + C) - identity
AB (1)
=AB

14. Change the value of the inputs A, B, and C and write your answer below.
Table 2.2 Logic Gate of Z
INPUT PER TERM OUTPUT OUTPUT
A B C A+B’ B’ B+C X Simplified Equation
((A+B’)(
B+C))
0 0 0 1 1 0 0 0 0
0 0 1 1 1 1 1 1 0
 0 1 0 0 0 1 0 0 0
0 1 1 0 0 1 0 0 0
1 0 0 1 1 0 0 0 0
1 0 1 1 1 1 1 0 0
1 1 0 1 0 1 1 1 1
1 1 1 1 0 1 1 1 1

15. Place the screenshot of your work below:

6. Data and Results:

6
Problem A:
1. The logic circuit shown in Figure 2.4 is used to turn on a warning buzzer at X based on the input
conditions at A, B, and C. Construct and simulate using Multisim for the given diagram and write your
answer on Table 2.3.

Figure 2.4: Logic Circuit of Problem A

2. Place the screenshot of your work below:

3. Refer to no.1, write the equation of the circuit, and simplify the equation using Boolean algebra.

((A’+B)(C’B))
(A’+B)(C’B) - distributive
A’C’B + BC’B - idempotent
A’C’B + C’B - distributive
C’B(A+1) - identity
C’B(1)
= BC’

4. Construct the circuit of the simplified equation on Multisim.

5. Place the screenshot of your work below:

7
 6. Change the value of inputs of the simplified equation and write your answer below.
Table 2.3: Logic Circuit for Program A
INPUT PER TERM OUTPUT OUTPUT
A B C A’ C’ A’+B BC’ Z Simplified Equation
0 0 0 1 1 1 0 0 0
0 0 1 1 0 1 0 0 0
0 1 0 1 1 1 1 1 1
0 1 1 1 0 1 0 0 0
1 0 0 0 1 0 0 0 0
1 0 1 0 0 0 0 0 0
1 1 0 0 1 1 1 1 1
1 1 1 0 0 1 0 0 0

6. Conclusion:

Based from the results of the experiment, what general rule can you apply for?

We have studied about the several logic gates and their functions in a circuit. A
fundamental idea in the study of computers and digital electronics is boolean algebra.
The creation of logic circuits is done in this lab. The lab will offer practical logic circuits
experiments, and it can also assist the students in comprehending how digital systems
work. The pupils' ability to think critically, solve problems, and comprehend boolean
algebra will all be improved as a result.