Friday, 17 January 2014

CS302 - Digital Logic Design Assignment No 3 Date:24th Jan 2014

Question 1                                                                                                                                          [15 Marks]

Using Quine-McCluskey method, reduce the expression given below by following all the steps.
           
X= A’B’C’D +A’B’CD+A’BC’D+A’BCD’+AB’C’D’+AB’C’D+ABC’D’+ABCD’+ABCD

Question 2                                                                                                                                          [5 Marks]

Write an ABEL equation against the following Boolean expressions

1)      X = AB’ + B’C + B’D’
2)      Y = A’B’C  ⊕ BD’ ⊕ D

Note! 
⊕ = XOR,  A’ = A bar or A complement