SIMPLIFICATION OF BOOLEAN FUNCTION

ACTIVITY 3
COURSE CODE: PROGRAM:

COURSE TITLE: DATE PERFORMED:

SECTION: DATE SUBMITTED:

STUDENT NAME: INSTRUCTOR:

OBJECTIVE:

This activity aims to demonstrate the ability to simplify Boolean Expressions using Boolean
Algebra Laws and theorems and discuss the importance of simplifying circuits.

INSTRUCTION:

1. Study the given Boolean expression and its equivalent Logic circuit diagram in Figure 3.1.

2. Construct the circuit and simulate in Logic.ly by connecting the INPUTS (A, B and C) to the
data switches, the logic gates needed, and the OUTPUT (F) to the LED as indicator.
3. Construct the circuit and simulate in TinkerCAD by connecting the INPUTS (A, B and C) to
the data switches, the ICs needed (following the pin configurations), and the OUTPUT (F) to
the LED as indicator.
4. Find out the number of each logic gate and ICs required to construct the given
diagram. Fill out table 3.1.
 Table 3.1 Quantity of Logic Gates and ICs
Logic Gate Quantity IC Type Quantity

5. Apply the different combinations to the data switches and observe the corresponding output
in every combination. Record the answers in Table 3.2

6. Simplify the Boolean expression indicated in Step 1. Write the simplified Boolean expression
and draw the logic circuit equivalent:

Simplified Boolean Expression Simplified Logic Function

Solution: Circuit:
7. Construct and simulate the circuit function again in Logic.ly and TinkerCAD. Count the number
of logic gates and ICs to be used to construct the circuit. Fill-out Table 3.3.

Table 3.3 Quantity of Logic Gates and ICs

Logic Gate Quantity IC Type Quantity

8. Apply the different combinations to the input lines and observe the corresponding output for
every combination. Record the results in Table 3.4.

9. Write a one paragraph (at least 10 sentences) Observations for this activity.
10. Write a one paragraph (at least 10 sentences) Conclusion for this activity.
11. Submit a clear captured image file or scanned copy of this written report.