12-08-2014, 08:48 PM
[h=1][/h]
CS302 Digital Logic Design Assignment No. 2 Solution and Discussion Fall 2014 Due Date: Dec 09, 2014
Question 1 [10 Marks]
See the following Karnaugh Map, identify adjacent groups of 1's, and generate a minimal SOP expression from those
groupings.
AB\CD 00 01 11 10
00 1 0 1 1
01 0 1 1 1
11 × × × ×
10 1 1 × ×
Question 2
[10 Marks]
Using Quine-McCluskey method, reduce the expression given below by following all the steps.
X=A’B’C’D’+A’B’C’D+A’B’CD’+A’BCD’+ A’BCD+AB’C’D’+AB’C’D+ ABCD’
Question 3 [5 Marks]
Simplify following expression using Boolean algebra rules and mention on each step the rule applied.
A’(A + B) + (AA + B)(A + B’)
CS302 Digital Logic Design Assignment No. 2 Solution and Discussion Fall 2014 Due Date: Dec 09, 2014
Question 1 [10 Marks]
See the following Karnaugh Map, identify adjacent groups of 1's, and generate a minimal SOP expression from those
groupings.
AB\CD 00 01 11 10
00 1 0 1 1
01 0 1 1 1
11 × × × ×
10 1 1 × ×
Question 2
[10 Marks]
Using Quine-McCluskey method, reduce the expression given below by following all the steps.
X=A’B’C’D’+A’B’C’D+A’B’CD’+A’BCD’+ A’BCD+AB’C’D’+AB’C’D+ ABCD’
Question 3 [5 Marks]
Simplify following expression using Boolean algebra rules and mention on each step the rule applied.
A’(A + B) + (AA + B)(A + B’)