Assignment_1, Solutions
Uploaded by
Ali AbrarAssignment_1, Solutions
Uploaded by
Ali AbrarMemorial University of Newfoundland
Faculty of Engineering and Applied Science
ENGI 9819: Computer Hardware Foundations
ASSIGNMENT 1 Solutions
P. 1. Using Boolean algebra, derive a minimized sum-of-product expression for (6 marks each)
e) J = (A'+B) '(A'+C') '(AB'C)'= (AB’)(AC)(A'+B+C')
= AB’ACA'+AB’ACB+AB’ACC'=0
P.2. Consider the following logic circuit.
(a) Complete the truth table for output F (5 marks).
1
Answer:
X Y Z F
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
(b) Write the canonical sum-of-products representation for F (5 marks).
Answer: F= Ʃm(0,1,2,3,4,5,6)
(c) Using Boolean algebra, determine a minimized sum-of-products representation for F (5
marks).
Answer: F = A’+B’+C’
P.3. Optimize the following Boolean expressions using a K-Map (6 marks each):
(a) X’Z’ +YZ’ +XYZ
(b) A’B+B’C+A’B’C
Answer:
2
P.4. Optimize the following Boolean functions in product-of-sums form:
(a) F(W,X,Y,Z)=Ʃm (0,2,3,4,8,10,11,15)
(b) F(A,B,C,D) =ΠΜ (0,2,4,5,8,10,11,12,13,14)
Answer:
(a) F(W,X,Y,Z)=Ʃm (0,2,3,4,8,10,11,15)= ΠΜ(1,5,6,7,9,12,13,14)
After simplification using K-map; F(W,X,Y,Z)=(Y+Z’)(W+X’+Y’)(W’+X’+Z)
(b) After simplification using K-map : F(A,B,C,D)=(B+D)(B’+C)(A’+D)(A’+B+C’)
P.5. Optimize the following Boolean function by means of a four-variable K-Map (13 mark):
F(A,B,C,D) =Ʃm(0,1,7,13,15)+ Ʃd(2,6,8,9,10)
Answer: The simplified function is: F(A,B,C,D) = B’C’+ABD+BCD (8 marks for correct table
and groupings and 5 marks for correct simplified function)
