Experiment 1
De Morgan's Law
Aim:
The aim of this experiment is to demonstrate and verify De Morgan's Law in digital electronics circuits.
Apparatus:
1. Breadboard
2. Logic gates (AND, OR, and NOT gates)
3. Switches
4. LEDs (Light Emitting Diodes)
5. Resistors
6. Connecting wires
Theory:
De Morgan's Law is a fundamental concept in digital electronics named after the mathematician and
logician Augustus De Morgan. It states two important equivalences:
1. The complement of the logical AND operation between two variables is equivalent to the logical
OR operation between their complements. Symbolically: NOT(A AND B) = (NOT A) OR (NOT
B)
2. The complement of the logical OR operation between two variables is equivalent to the logical
AND operation between their complements. Symbolically: NOT(A OR B) = (NOT A) AND
(NOT B)
These laws are extensively used in digital logic circuit design and simplification.
De Morgan's Law has several practical applications. It is utilized in digital circuit design for simplifying
and optimizing logic expressions. In programming, it aids in optimizing code efficiency and manipulating
Boolean algebra. Additionally, De Morgan's Law is employed in software development to enhance logical
expressions and improve overall program performance.
Circuit Diagram:
Figure 1.1
Procedure:
1. Set up the breadboard and connect the required logic gates (AND, OR, and NOT gates) to
demonstrate De Morgan's Law.
2. Connect the switches to the input terminals of the logic gates.
3. Connect the output terminals of the gates to the LEDs.
4. Implement the logic circuit for the expression NOT(A AND B) using individual gates, and
connect the corresponding LEDs.
5. Implement the logic circuit for the expression (NOT A) OR (NOT B) using individual gates, and
connect the corresponding LEDs.
6. Verify that the outputs of both circuits are the same for all possible input combinations.
7. Repeat steps 4-6 for the expression NOT(A OR B) and (NOT A) AND (NOT B).
Truth Table:
Truth Table for NOT(A AND B) and (NOT A) OR (NOT B):
A B NOT(A AND B) (NOT A) OR (NOT B)
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0
Truth Table for NOT(A OR B) and (NOT A) AND (NOT B):
A B NOT(A OR B) (NOT A) AND (NOT
B)
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0