AIR UNIVERSITY
EXPERIMENT NO 2
Lab Title: Verification Of DeMorgan’s Laws.
Student Name: Muhammad Zain Ali Reg. No: 2 4 1 0 9 4
Objective: The main purpose of this experiment is verify DeMorgan’s laws by
Using logical gates and truth tables.
LAB ASSESSMENT:
Excellent Good Average Satisfactory Unsatisfactory
Attributes (5) (4) (3) (2) (1)
Ability to Conduct
Experiment
Ability to assimilate the
results
Effective use of lab
equipment and follows
the lab safety rules
Total Marks: Obtained Marks:
LAB REPORT ASSESSMENT:
Excellent Good Average Satisfactory Unsatisfactory
Attributes
(5) (4) (3) (2) (1)
Data presentation
Experimental results
Conclusion
Total Marks: Obtained Marks:
Date: Signature:
EXPERIMENT 02
DeMorgan’s Law
Objectives:
To verify the DeMorgan’s Law
Equipment required:
TTL IC-7408
TTL IC-7432
TTL IC-7404
TTL IC-7400
TTL IC-7402
Digital Electronics Trainer
Background Knowledge:
Boolean algebra has postulates and identities. We can often use these laws to reduce expressions or put
expressions into a more desirable form. One of these laws is the DeMorgan’s Law. DeMorgan’s Law has
two conditions, or conversely, there are two laws called DeMorgan’s Laws.
DeMorgan’s First Law:
DeMorgan’s Law for two inputs A and B is
(AB)' = A' + B'
This means that NAND gate function is identical to OR gate function with complemented inputs.
DeMorgan’s Second Law:
DeMorgan’s second law is
(A + B)' = A'. B'
This means that NOR function is equal to the AND gate function with complemented inputs.
Logic Diagrams:
First Law:
Left Hand Side: Right Hand Side:
Second Law:
Left Hand Side: Right Hand Side:
Procedure:
1. Patch the left hand side circuit for the first condition of DeMorgan’s Law on the Digital electronics
trainer. Connect the inputs to the input switches and output to the LED and verify the truth table
for all the combinations.
2. Similarly, patch the right hand side circuit for the first condition of DeMorgan’s Law on the Digital
electronics trainer. Connect the inputs to the input switches and output to the LED and verify the
truth table for all the combinations. Both the truth tables should be similar.
3. Repeat steps 1 and 2 for the second condition of DeMorgan’s Law.
Lab Tasks:
Follow the given procedure and complete the given truth tables for both the laws.
Truth Table for DeMorgan’s First Law:
Inputs Truth Table Outputs for Each Term
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
Truth Table for DeMorgan’s Second Law:
Inputs Truth Table Outputs for Each Term
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
Hardware Implementation of First Law:
L.H.S
R.H.S
Hardware Implementation of Second Law:
L.H.S
R.H.S
Simulation Activities:
1. Simulate the given circuit for the verification of DeMorgan’s first law.
Simulation:
L.H.S
R.H.S
2. Simulate the given circuit for the verification of DeMorgan’s second law.
Simulation:
L.H.S
R.H.S
Conclusion:
De Morgan's Laws plays a vital role in solving problems in Boolean algebra. In this lab we proved that laws by
using logic gates. They help us to understand logical expressions. The laws are:
1. (AB)' = A' + B'
2. (A + B)' = A'.B'
We tested these laws using truth tables and real circuits in Proteus. Our results showed that:
- The 1st law works only when both inputs are 1.
- The 2nd law works only when both inputs are 0.
This proves that De Morgan's Laws are correct and useful for solving logical problems