CS302 - Assignment # 2
Question 2 Image
CS3022onlyQ2.jpg
Question 1: [marks: 10]View more random threads:
- Spring 2010_MGT201
- CS502 Fundamentals of Algorithms Assignment No. 02 Solution...
- FIN722 Assignment No 1 Fall 2014 Solution and Discussion...
- FIN622_ Corporate Finance Assignment # 1 fall 2010 idea...
- MGT601 SME Management Assignment No. 01 Fall 2014 Ideal...
- ENG301 Assignment 4 Deadline 28 July 2010
- CS601 Data Communication Assignment No. 01 Discussion...
- Post your virtual university assignment for spring 2012...
- MTH101 Assignment 3 Deadline 7 July 2010
- CS506 Web Design and Development Assignment 1 Fall semester...
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)
Sponsored Links
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.
22.jpg
For Solution In Doc file see the attachment below
CS302Assignment2Solution.doc
CS302 - Assignment # 2
Question 2 Image
CS3022onlyQ2.jpg
There are currently 1 users browsing this thread. (0 members and 1 guests)