Friday, May 14, 2010

CS302 Digital Logic Design Assignment # 2 Spring 2010

Question 1:                                                     [marks: 10]



Simplify the following Boolean expressions, using Boolean Algebraic rules:



 ABC' + A'BC + ABC + A'BC'

= BC' (A+A')+BC' (A+A') //*Because A+A'=1

So,

=BC' (1)BC' (1)

=B(C'+C)=B(1)

=B


 (BC' + A'D) (AB'+ CD')

=BC'AB'+BC'CD'+A'DAB'+A'DCD'

=C'ABB'+BD'C'C+DB'AA'+A'CDD'

BY RULE A.A'=0

SO

BB'=0, CC'=0 , AA'=0 AND DD'=0

Answer =0





Question 2:                                                      [marks: 10]

Simplify the following Boolean functions, using Karnuagh maps:


 F(A,B,C,D) = ∑ (3,7,11,13,14,15)



 Solution:

Since the function has four variables so,a four variable map must be used.The minterms listed in the sum are marked by 1’s in the map.
 
 
 
Vugurus. Powered by Blogger.

Popular Posts

Blog Archive

Labels

Imp Links

Followers

Total Pageviews

Subscribe for email

Blog Archive

Labels

Search

Loading...

About Me