DISCUSSION OF RESULTS

The experiment is divided into four parts: verifying the OR expression, the AND circuit,
the NOR circuit, and the NAND circuit using De Morgan’s Theorem.
On Part 1A, the OR circuit with LED indicator is used to verify the OR expression. An LED
indicator is used to determine whether the resulting output is logic high (1; ON) or logic low (0;
OFF). On this circuit, negated variables A and B (A’) and (B’) are used as inputs of AND gate
(A’.B’) followed by a NOT gate (A’.B’)’. When both inputs are connected to the ground, their
logic value is 0. As it enters the NOT gate, the output then becomes logic value 1. Then, these
values enter the AND gate. Based from the truth table, 1 AND 1 is 1. This logic value then serves
as the input of the NOT gate at the rightmost part of the circuit. Thus, when connected to the
NOT gate, logic value 1 now becomes logic value 0. Hence, when both inputs A and B are
connected to the ground, the OR circuit gives the final logic value of 0. This in turn does not
light up the LED.
Through the De Morgan’s theorem, it is proved that (A’.B’)’ = ((A+B)’)’ or simply
(A+B).Going back to De Morgan’s Theorem: (A’.B’)’ = (A+B). Substituting this condition (both
inputs connected to the ground) to the equation: (0 or 0) = (0) which proves the theorem. Same
is true with other conditions. When one input is connected to the ground (logic 0) and when
one is connected to +5V (logic 1), it gives the equation (0 or 1) = 1. When both connections are
on +5V, it gives the equation 1 or 1 which is 1. This part simply just describes the OR expression.
On Part 1B, the AND circuit with LED indicator is used. On this circuit, variables A and B
are both negated (A’) and (B’) and then put together through the OR gate (A’ + B’) followed by a
NOT gate (A’ + B’)’. Through the De Morgan’s theorem, (A’ + B’)’ = ((AB)’)’ or simply (AB). This
theorem is proved on this part. An LED indicator is used to determine whether the resulting
output is logic high (1; ON) or logic low (0; OFF). Connections A and B are varied. When both
inputs are connected to the ground, their logic value is 0. As it enters the NOT gate, the output
then becomes logic value 1. Then, these values enter the OR gate. Based from the truth table, 1
OR 1 is 1. And then when connected to the NOT gate, logic value 1 now becomes logic value 0.
Hence, when both inputs A and B are connected to the ground, the AND circuit gives the final
logic value of 0. This in turn does not light up the LED. Going back to De Morgan’s Theorem: (A’
+ B’)’ = (AB). Substituting this condition (both inputs connected to the ground) to the equation:
(0 AND 0) = (0) which proves the theorem. Same is true with other conditions. When one input
is connected to the ground (logic 0) and when one is connected to +5V (logic 1), it gives the
equation (0 AND 1) = 0. When both connections are on +5V, it gives the equation 1 AND 1 which
is 1. This part simply just describes the AND expression.
On the other hand, part 2A is about the NOR circuit. Going back to the De Morgan’s
theorem, the expected output should be an AND expression. The output of two 2-input NOR
gate ICs are used as the inputs on another NOR gate. The result proves to be equal to the truth
table of an AND gate. This is because, as explained earlier, ((A+B)’)’ = ((A’.B’)’ or simply (AB).
 Part 2B is about the NAND circuit. Going back to the De Morgan’s theorem, the
expected output should be an OR expression. The output of two 2-input NAND gate ICs are
used as the inputs on another NAND gate. The result proves to be equal to the truth table of an
OR gate. This is because, as explained earlier, (A’.B’)’ = ((A+B)’)’ or simply (A+B)

CONCLUSION:
The objectives of the experiment are 1) to verify De Morgan’s theorem, 2) to use NAND circuit
to operate as an OR gate, and 3) to use NOR circuit to operate as an AND gate.
De Morgan’s theorem states that inversion or negation of a Boolean expression maybe
accomplished by negating each variable and changing each AND to OR and each OR to AND.
When the output of two NOT gates is connected to an AND gate followed by a NOT gate, the
result is like that of the OR gate. Likewise, when the output of two NOT gates is connected to an
OR gate followed by a NOT gate, the result is like that of the AND gate.
NAND and NOR gates, on the other hand, are universal gates because they can be used to
obtain the function of the other logic gates by using the principle of negation. When the
outputs of 2 NAND gates are used as an input of another NAND gate, the result is like that of an
OR expression. Similarly, when the outputs of 2 NOR gates are used as an input of another NOR
gate, the result is like that of an AND expression.