Scribd
Upload
732 views2 pages

DLD Lab Manual 04

This document describes an experiment to verify Demorgan's laws using logic gates. The experiment uses a logic trainer, integrated circuits, and a power supply to construct circuits representing the Boolean laws. Truth tables are generated to check if the laws are valid by applying various input combinations and observing the LED outputs. The purpose is to understand how Demorgan's theorem allows simplifying Boolean expressions by cancelling redundant inversions.

Uploaded by

Sana gull
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
732 views2 pages

DLD Lab Manual 04

This document describes an experiment to verify Demorgan's laws using logic gates. The experiment uses a logic trainer, integrated circuits, and a power supply to construct circuits representing the Boolean laws. Truth tables are generated to check if the laws are valid by applying various input combinations and observing the LED outputs. The purpose is to understand how Demorgan's theorem allows simplifying Boolean expressions by cancelling redundant inversions.

Uploaded by

Sana gull
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Digital Logic Design, EE Department, Wah Engineering College

EXPERIMENT NO. : 04

Verification of Demorgans Law


Objective:
Boolean algebra uses many of the same laws as those of ordinary algebra. De Morgans
theorem allows for the simplification of a Boolean Expression by the cancellation of
some redundant inversions. In this experiment, well know about these laws & theorem.

Apparatus:
Logic trainer
Connecting wires
IC: 7400LS, 7408LS, 7404LS & 7432LS
Power supply

Theory:
De Morgan developed a theorem that allows conversion between a logic expression that
has inversions on the output to a different logic expression with the inversions on each of
the inputs. This may allow for the simplification of a Boolean Expression by the
cancellation of some redundant inversions. There are two Boolean Equations that
represent De Morgan's Theorem:

Procedure:
At first construct the circuits shown in the Boolean laws.
Check if the laws are valid. Give truth tables for each law.
Apply various combinations of inputs as shown in the truth table and observe the
conditions of LEDs.

Logic Diagram:
Digital Logic Design, EE Department, Wah Engineering College

Observations & Calculations:

Truth table that verifies 1st Demorgans law: (AB)=A + B


A B (AB) A + B

Truth table that verifies 2nd Demorgans law: (A+B)=A. B


A B (A+B) A. B

Conclusion:

You might also like