Experiment Number: Experiment 4

Experiment Name: Boolean Algebra

Date: Thursday, April 17th, 2025.

Name: Emmanuel Saviour

Student Number: 22120712851

Group Members: Emmanuel Saviour

Akinjaiyeju Tosin
Nasir Saleem
ABSTRACT
This experiment explores the practical implications of DeMorgan's Theorem within digital
logic design, emphasizing its role in simplifying and transforming Boolean expressions for
optimal circuit implementation. Through systematic construction and analysis of logic
circuits using IC 7404 (NOT), 7402 (NOR), and 7400 (NAND) gates, the experiment validates
the duality principle and demonstrates logical equivalence across different logic gate
families. Truth tables were generated and evaluated to confirm theoretical identities, such
as the transformation of complemented OR functions into NAND or NOR equivalents. The
results underscore DeMorgan’s Theorem as a foundational tool in digital electronics,
enabling efficient circuit redesign by interchanging logic operations while preserving
functionality—an essential skill in hardware optimization and logic synthesis.

AIM
The aim of this experiment is to apply and verify DeMorgan’s Theorem through the
construction, modification, and analysis of digital logic circuits. The experiment seeks to
demonstrate the practical conversion between different logic families (AND/NAND and
OR/NOR) and to deepen understanding of the duality principle in Boolean algebra,
highlighting its importance in simplifying and optimizing circuit design.

THEORY
Boolean algebra, the mathematical foundation of digital logic design, provides a structured
way to represent and manipulate logic expressions. Among its many theorems, De-
Morgan’s Theorems hold particular importance for simplifying and transforming logic
expressions, especially in the practical construction of circuits using universal gates like
NAND and NOR.
De-Morgan’s Theorems consist of two fundamental laws:
1. Theorem 1 (Complement of a Sum):
(A+B)′=A′⋅B′(A + B)' = A' B'(A+B)′=A′⋅B′
This law states that the complement of the logical OR of two variables is equal to
the logical AND of the complements of the variables.
2. Theorem 2 (Complement of a Product):
(A⋅B)′=A′+B′ = A' + B'(A⋅B)′=A′+B′
This law states that the complement of the logical AND of two variables is equal to
the logical OR of the complements of the variables.
These theorems are essential because they allow for the transformation of expressions into
forms that are more suitable for physical implementation, particularly when only NAND or
NOR gates are available. For example, a NAND gate behaves like a negative-OR gate, while
a NOR gate functions as a negative-AND gate, as illustrated in typical gate equivalence
diagrams.
To verify the correctness of these theorems, truth tables are often used. These tables
demonstrate that the outputs of both sides of each theorem are equal for all combinations
of input values. For instance:
Truth Table for Theorem 1:

A B A+B (A + B)' A' B' A'·B'

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

Truth Table for Theorem 2:

A B A·B (A·B)' A' B' A'+B'

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

Since the outputs on both sides of each equation match, the theorems are validated.
De-Morgan’s Theorems can also be mathematically proven using Boolean laws such as
complementation, distribution, and identity. These proofs show that the sum or product of
variables, when complemented, obeys predictable transformation patterns, reinforcing the
utility of these theorems in algebraic manipulation and digital circuit design.
Furthermore, these theorems extend beyond two variables. For example:

• (A+B+C)′=A′⋅B′⋅C′(A + B + C)' = A' B'C'(A+B+C)′=A′⋅B′⋅C′

• (A⋅B⋅C)′=A′+B′+C′(ABC)' = A' + B' + C'(A⋅B⋅C)′=A′+B′+C′
Theorems assist engineers in converting a logic expression with a mixture of gates into an
equivalent circuit composed entirely of a single gate type, which is a common requirement
in digital logic design and fabrication.
One of the primary areas where De-Morgan’s Theorems find application is digital circuit
design. In designing logic circuits, engineers often face the challenge of minimizing the
number of logic gates used, not only to reduce the complexity of the system but also to cut
down manufacturing costs. De-Morgan’s Theorems are instrumental in transforming
complex Boolean expressions into simpler or more implementable forms. For instance, a
given logic function involving AND, OR, and NOT gates can be converted into a circuit using
only NAND or NOR gates—types of gates that are easier and cheaper to fabricate due to
their universal functionality. This property makes De-Morgan’s Theorems a powerful
optimization technique in the hardware design phase of digital electronics.
Beyond circuit design, De-Morgan’s Theorems are also highly relevant in set theory and
Venn diagram analysis. In this context, the theorems are used to describe relationships
between the union and intersection of sets through their complements. Visual
representations using Venn diagrams effectively illustrate how the complement of an
intersection corresponds to the union of the individual complements and vice versa. These
visualizations help in understanding the deeper logical structure of set relationships and
are especially useful in mathematical proofs and teaching.
In the field of programming and logic design, De-Morgan’s Theorems are used to simplify
complex conditional expressions. Software engineers and programmers regularly deal with
logical conditions in control flow statements, and the ability to rewrite such conditions in
alternate forms is crucial for code clarity, maintainability, and performance. For example,
transforming a statement like !(A && B) into !A || !B not only simplifies logic but can also
improve how conditions are evaluated in certain programming languages or processors.
Furthermore, probability and statistics benefit from De-Morgan’s Theorems when working
with compound events and conditional probabilities. These theorems allow statisticians to
rewrite logical conditions in terms of known probabilities, making it easier to compute the
likelihood of complementary events. They help in breaking down complex probabilistic
statements into simpler components, aiding both theoretical derivations and practical
computations.
APPARATUS

• DC power supply - (0 to 30V)

• Multi-meter
• IC 7404
• IC 7402
 • IC 7400
• 3 SPST Switch
• LED
• Jumper wires
• Bread Board.

EXPERIMENT I: Logic Circuit Analysis Using De-Morgan’s Theorem

The procedure for Experiment 1 began with constructing the logic circuit as shown in Figure
1. The circuit consisted of a combination of OR, NOT, and AND gates. Inputs A and B were
connected to different gates to observe how the signals were transformed as they passed
through the circuit.

Figure 1 Image of the combinational circuit of Experiment I

After the circuit was built, a truth table was created by listing all possible input
combinations of A and B. The outputs at various points in the circuit—such as U, V, W, and
the final output X—were recorded. As the experiment progressed, Boolean expressions
were written beside each gate output on the circuit diagram. For example, the output at
point U was labeled A + NOT B, while points V and W represented NOT A and NOT B,
respectively. The final output X was analyzed and compared with the simplified expression
derived using De-Morgan’s Theorem.

EXPERIMENT II: Complex Logic Evaluation with Inverted Inputs

For Experiment 2, the logic circuit shown in Figure 2 was constructed. This circuit included
a more complex arrangement of logic gates, with both A and B serving as inputs that
passed through various NOT, OR, and AND gates.
Once the circuit was assembled, a truth table was created to capture the output for each
possible combination of A and B. As the experiment was performed, the Boolean equations
for each gate output were written on the circuit diagram. For example, the OR gate received
one inverted and one regular input, while the AND gate took a mix of these inputs to
generate its output. Key points in the circuit, including W, X, and Y, were observed and
analyzed to trace how the logic flowed and transformed.

Figure 2 Image of the combinational circuit of Experiment II

EXPERIMENT III: Multi-Output Logic Design and Simplification

In Experiment 3, the circuit shown in Figure 3 was built to explore a multi-output logic
system. The same inputs, A and B, were used to generate two different outputs: X and Y.
The circuit incorporated AND, NOT, and additional logic gates to create these paths.

Figure 3 Image of the combinational circuit of Experiment III

After constructing the circuit, a truth table was generated for all combinations of A and B.
Boolean expressions were written beside each gate output on the diagram. The first path
included an AND gate followed by a NOT gate to produce output X, while the second path
combined two NOT gates and an AND gate to produce output Y.
EXPERIMENT IV: Multi-Input Logic Circuit with De-Morgan’s Application
In Experiment 4, the logic circuit was constructed as shown in the diagram. This setup
introduced a third input variable, C, along with A and B, making the logic more complex and
comprehensive. The circuit featured a series of AND, OR, and NOT gates configured to
produce two outputs: X and Y.
The first step was to build the circuit according to the given diagram. Once completed, a
truth table was developed to list all possible combinations of the inputs A, B, and C. This
helped in tracking the output results of each gate and the final outputs.

Figure 4 Image of the combination circuit of Experiment IV

During the experiment, each gate's output was labeled with its Boolean expression based
on its inputs. For instance, intermediate outputs such as U, V, and W were analyzed, and
their Boolean values were recorded as per the logic configuration. The final outputs X and Y
were then determined based on these intermediate signals.

RESULTS
The results of the four experiments are presented in the form of truth tables for each circuit.
Each table outlines all possible combinations of input literals and their corresponding
outputs. Additionally, every literal in the circuit is accompanied by its respective Boolean
expression, clearly showing the logical relationship between inputs and outputs throughout
the circuits.
Figure 4 Truth Table for Experiment I

A B U= (A+B)' V= A' W= B' Y= (A+B)'' X= (A'.B')'

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

Figure 5 Truth Table for Experiment II

A B W= (A'+B)' X= (A'+B)'' Y= (A.B')'

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

Figure 6 Truth Table for Experiment III

A B U= (A.B)' V= A' W= B' X= (A.B)'' Y= (A'+B')'

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

Figure 6 Truth Table for Experiment IV

V=
A B U= (A.C)'' (BC)'' W= (A'.B')' X= ((A.C)'' + (B.C)'')" Y= ((A'.B')' .C)"
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 1 0 0
0 1 1 0 1 1 1
1 0 0 0 1 0 0
1 0 1 1 1 1 1
1 1 0 0 1 0 0
1 1 1 1 1 1 1
ANALYSIS
The data gathered from the four experiments strongly supports DeMorgan’s Theorems by
providing truth tables that confirm the logical equivalence between the original Boolean
expressions and their DeMorgan’s-transformed counterparts. For each circuit, we observe
that the outputs X and Y—which represent the two sides of a DeMorgan’s identity—yield
identical results for all combinations of the inputs. This consistency across all entries in the
truth tables demonstrates the correctness of the theorems.
Experiment 1:
• DeMorgan Relationship:
X = (A + B)'
Y = A'.B'
• Explanation:
The output X represents the complement of the OR operation between A and B,
while Y represents the AND operation between the complements of A and B.
According to DeMorgan's first law, these two expressions should be equivalent. The
truth table confirms that both X and Y produce the same outputs for all input
combinations, supporting the identity:
(A + B)' = A'.B'

Experiment 2:
• DeMorgan Relationship:
X = (A.B)'
Y = A' + B'
• Explanation:
Here, X is the complement of the AND operation between A and B, while Y is the OR
of their complements. This aligns with DeMorgan’s second law. Again, the truth
table shows matching outputs for X and Y, validating the expression:
(A.B)' = A' + B'

Experiment 3:
• DeMorgan Relationship:
X = (A + B)'
Y = A'.B'
 • Explanation:
This setup reiterates the first DeMorgan law using a different circuit configuration.
The values for X and Y are identical for every input pair, confirming the relationship:
(A + B)' = A'.B'

Experiment 4:
• DeMorgan Relationship:
X = ((A.C)' + (B.C)')'
Y = (A'.B')'.C
• Explanation:
This circuit involves three variables and demonstrates an extended application of
DeMorgan’s Theorems. The expression for X applies DeMorgan’s law to two ANDed
pairs (A.C and B.C), complements each, ORs the result, and then complements the
outcome. The expression for Y simplifies the same logic using DeMorgan
transformations and factoring. The matching output values of X and Y across all
combinations confirm that this extended identity holds true as well.

DISCUSSION
The four experiments conducted were aimed at demonstrating and verifying the application
of DeMorgan’s Theorems in digital logic circuits. Each experiment involved constructing
specific logic diagrams and generating corresponding truth tables based on all possible
input combinations. The purpose was to observe how logical operations behave under
inversion and to confirm the theoretical equivalence between original Boolean expressions
and their DeMorgan’s counterparts.
In Experiment I, the truth table illustrates the behavior of the expression (A + B)' and
compares it with the equivalent form (A'.B'). The final output X shows that both expressions
produce the same result across all input combinations, confirming the first of DeMorgan’s
Theorems.
Experiment II focuses on the expression (A.B)' and its equivalent A' + B'. The outputs from
the truth table demonstrate a clear match between the two forms, validating the second of
DeMorgan’s Theorems. This proves that the complement of a product is equal to the sum of
the complements.
In Experiment III, the logical operations are rearranged but still adhere to DeMorgan’s
principles. The result Y confirms that (A + B)' is indeed equivalent to A'.B', even when
implemented using a different circuit structure. The table consistently reflects the
expected outcomes.
Experiment IV introduces a more complex scenario involving three variables: A, B, and C.
The circuit evaluates compound expressions such as ((A.C)'' + (B.C)'')' and ((A'.B')'.C)''.
Despite the added complexity, the truth table confirms that the logical outputs X and Y are
correct for every combination of inputs. This highlights the scalability of DeMorgan’s
Theorems to multi-variable expressions and more intricate circuit designs.

CONCLUSION
This series of experiments successfully demonstrated the validity and practical application
of DeMorgan’s Theorems in digital logic circuits. Through the construction and analysis of
four different logic configurations, we verified that the theoretical Boolean equivalences
hold true across all possible input combinations. The results not only affirmed the
mathematical integrity of the theorems but also emphasized their importance in
simplifying and designing efficient logic circuits.
By confirming that (A + B)' is equivalent to A'.B' and that (A.B)' is equivalent to A' + B', we gain
valuable tools for converting and optimizing logic expressions, especially when
implementing them using NAND and NOR gates. Furthermore, the extension of these
principles to more complex expressions involving three variables underscores their
robustness and relevance in digital electronics.
In conclusion, understanding and applying DeMorgan’s Theorems enhances both the
analytical and practical skills required in logic circuit design. These foundational principles
are essential for students, engineers, and anyone working in digital system development.

REFERENCES
[1] M. M. Mano and C. R. Kime, Logic and Computer Design Fundamentals, 5th ed. Upper
Saddle River, NJ: Pearson, 2015.
[2] T. L. Floyd, Digital Fundamentals, 11th ed. Boston, MA: Pearson, 2014.
[3] A. P. Malvino and J. A. Brown, Digital Computer Electronics, New York, NY: McGraw-Hill,
2018.
[4] Laboratory Manual for EEE 312 – Digital Electronics Experiments, Department of
Electrical and Electronics Engineering, 2025.
[5] J. F. Wakerly, Digital Design: Principles and Practices, 4th ed. Upper Saddle River, NJ:
Prentice Hall, 2006.