CS203 SWITHING THEORY AND LOGIC DESIGN MODAL QUESTIONS FOR SECOND YEAR S3

CS203 SWITHING THEORY AND LOGIC DESIGN MODAL QUESTIONS FOR SECOND YEAR S3 

SWITHING THEORY AND LOGIC DESIGN

QUESTION PAPERS

PART A

(Answer All Questions, 5 x 2 = 10 Marks)

1. What is distributive law?

2. Prove the theorem A+AB=A.

3. What is essential prime cube?

4. Simplify the expression: xyz + x’y + xyz’

5. Simplify the function F=Σ(1,3,5,7,8) using K-map.

PART B

(Answer Any Two Questions, 2 x 5 = 10 Marks)

6. State and prove DeMorgan’s law?

7. Simplify the function F=Σ(0,1,3,5,6,7,10,14,15) + Σd(8,12)

8. Find the complement and simplify to minimum number of literals

a) (BC’ + A’D) ( AB’ + CD’)

b) B’D + A’BC + ACD + A’BC

c) [(AB)’A] [ (AB)’ B]

d) AB’ + C’D’

9. Simplify the function F= Σ(0,1,2,5,6,7,8,9,10,14) using Quine Mc Clusky tabular method.