CEA Assignment 1

Thành viên:
-Nguyễn Lê Anh
-Nguyễn Huỳnh Đức
-Nguyễn Cường Thịnh
-Huỳnh Quốc Cường
-Lê Anh Quân
-Nguyễn Phúc An
BÀI LÀM
1: Construct a truth table for the following Boolean expressions:
(1,5point)
F=( ( A+ B ) . ( A +C ) ) . ( A+ B+C ) +( ABC . ( A +B+ C ) )
Bài làm:

2. Apply DeMorgan’s theorem to the following equations: (1,5point)

A=( A . ( C+ B+ A+ D ) . D ) + D D E
Bài làm:
A=( A . ( C+ B+ A+ D ) . D ) + D D E
= AD(C + B + AD) + D + D + E
= ACD + ABD + ADAD + D + E
= ACD + ABD + AD + D + E
= AD(C + B + 1) + D + E
= AD + D + E
= D(A + 1) + E
= D+E
3. Draw a logic diagram for following expressions: (2point)
a) A) F= ABC + ( ( B+ C ) . ( B+C ) ) + ( A . C )
Bài làm

b) F=(B . ( C . ( D+ E+C ) ))+( E .C )

Bài làm
4. Minimize following Boolean functions using Karnaugh minimization
technique: (3point)
a) D=xy zt + x y z t + xy z t+ xyzt+ x yz t

b) D=wxyz+ wxy z +wx y z +w x y z +w xy z+ w x yz+ w x y z+ w x y z

5. Minimize following Boolean functions using Mc.Cluskey
minimization technique: (2point)
f ( w , x , y , z )=wx yz +wx yz + w x yz + z wx yz +wx y z +wxy z + wxyz

Bài làm
-Bước 1:
WYZ
WXZ √
WXY √ → WX
WX √
Y
WX Z √
X YZ
-Bước 2:

X YZ + WX