S23 DLD Lab04
S23 DLD Lab04
S23 DLD Lab04
Name
DE Morgan’s Theorem
X . Y = X+ Y
X +Y =X . Y
Example Solution for Task 1 and Task 2
Task 1:
a) By using basic rules of Boolean Algebra, find the minimized Boolean expression of
b) Create and fill the table for both expressions (given and minimized)
c) Implement both the expressions (given and minimized) in Circuit Maker with same
inputs (only three common inputs A, B and C) and verify your results
Task 2:
a) By using basic rules of Boolean Algebra, find the minimized Boolean expression of
Y (A , B ,C , D )=[ A B ( C +BD ) + A B ] C
a) Create and fill the table for both expressions (given and minimized).
b) Implement both the expressions (given and minimized) in Circuit Maker with same
inputs (only three common inputs A, B and C) and verify your results.
Task 3:
Prove that A . B= A+ B
INPUTS OUTPUTS
Ref # A B A.B A B A+ B
0
1
2
3
Task 4:
Prove that A+ B= A . B
INPUTS OUTPUTS
Ref # A B A+ B A B A.B
0
1
2
3
Task 5:
Prove the distributive law A( B+C)=A . B+ A . C
Ref
A B C Product Terms Sum Terms
#
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
Task 7:
INPUTS OUTPUTS
Ref
A B C F Y
#
0 0 0 0 0 1
1 0 0 1 1 0
2 0 1 0 1 1
3 0 1 1 0 0
4 1 0 0 1 1
5 1 0 1 0 0
6 1 1 0 1 0
7 1 1 1 0 1
Task 8:
Using truth table given in above task (Task 7),
a) For output Function F( A , B , C) ,write down the minimized form of SOP and POS using
K-Map grouping technique.
b) For output Function Y (A , B ,C) ,write down the minimized form of SOP and POS using
K-Map grouping technique.