Scribd
Upload
3K views3 pages

Experiment No. 3 Verification of Demorgan'S Theorem

This document describes an experiment to verify De Morgan's theorem, which allows simplifying Boolean expressions by moving negations inward. It defines De Morgan's theorem as having two statements: 1) (x+y+z) = x'y'z' and 2) (x*y*z) = x'+y'+z'. The experiment involves constructing logic circuits for each statement, generating truth tables to check they are valid, and verifying the circuits produce the same outputs. Students are asked to rewrite the expressions in terms of NAND and NOR gates and verify the results using universal gates.

Uploaded by

jocansino4496
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3K views3 pages

Experiment No. 3 Verification of Demorgan'S Theorem

This document describes an experiment to verify De Morgan's theorem, which allows simplifying Boolean expressions by moving negations inward. It defines De Morgan's theorem as having two statements: 1) (x+y+z) = x'y'z' and 2) (x*y*z) = x'+y'+z'. The experiment involves constructing logic circuits for each statement, generating truth tables to check they are valid, and verifying the circuits produce the same outputs. Students are asked to rewrite the expressions in terms of NAND and NOR gates and verify the results using universal gates.

Uploaded by

jocansino4496
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EXPERIMENT No.

3
VERIFICATION OF DEMORGANS THEOREM
Apparatus: 7408, 7432, 7404 digital logic kit and connecting leads.
OBJECTIVE
De Morgans theorem allows for the simplification of a Boolean Expression by the cancellation
of some redundant inversions. In this experiment, well know about this laws & theorem.
DE MORGAN`S THEOREM
De Morgan developed a theorem that allows conversion between logic expressions 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:
It has two statements.
1.

(x+y+z) = x .y .z
where let F1 = (x+y+z) & F2 = x .y .z

2.

(x.y.z) = x +y +z
where let F3 = (x.y.z)

F4 = x +y +z

x'
x'.y'
y'

F2 = x'.y'.z'
(To LED)
z'

x
x+y
y

x+y+z

F1 = (x+y+z)'
(To LED)

z
x'
x'+y'
y'

F4 = x'+y'+z'
(To LED)

z'
x

x.y
y

F3 = (x.y.z)'
(To LED)
z

Now we shall check this logic circuit by the Truth Table.

Truth Table
INPUTS
F1 = (x+y+z)
X
0
0
0
0
1
1
1
1

Y
0
0
1
1
0
0
1
1

Z
0
1
0
1
0
1
0
1

Actual

Observed

OUTPUTS
F2 = x .y .z
F3 = (x.y.z)
Actual

Observed

Actual

Observed

F4 =x +y +z
Actual

Observed

Comments: __________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________

PROCEDURE
1. At first construct the circuits shown in the Boolean laws.
2. Check if the laws are valid. Give truth tables for each law.
3. Construct the circuits shown in the circuit diagram.
4. Check if the two circuits give the same result.

____________________________
INSTRUCTORS SIGNATURE

OBSERVATIONS & RESULTS


1. Write truth tables for each Boolean law.
2. Write the equation for the figure 1. Now try to simplify it and find the equation for figure
2 from it.

Lab. Exercise:
Students are directed
1.
To write F1, F2, F3 and F4 in terms of NAND and NOR gates only.
2.
Then implement F1, F2, F3 and F4 with Universal gates and verify your result.
Comments: ________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________
_

____________________________
INSTRUCTORS SIGNATURE

You might also like