**PART I**

Answer all questions

**Question 1**

1. Define minterms and maxterms for the following expression in form of truth table

a. A’.B’.C+A.B’.C’+A.B’.C’+A.B.C [2]

b. Reduce the above expression with help of K-map [3]

c. Draw logic gate diagram for the derived expression using [5] NAND Gate

**Question 2**

2. Reduce the following using K-Map [10]

a. F(X,Y)=∑(X.Y+X’.Y’+X.Y’)

b. F(A,B)=(A’+B).(A+B’).(A’+B’)

c. F(A,B,C,D)= ∑(0,4,8,12)

d. F(X,Y,Z)=π(0,1,2,5)

**PART II**

** Attempt any one question**

**Question 3**

3. Obtain truth table for the following expression [2]

A.B.C’+A’.B+C’

4. Explain the principal of duality. Also explain the various steps involved in calculating it [2]

5. Define what is K-map [1]

**Question 3**

6. Find the compliment of F(m.n,o)=m’.n.o’+m’.n’.o [1]

7. Write the product of sum of the Boolean function, F(A,B,C) whose output is 0 only when,

A=1,B=0,C=0 [2]

A=0,B=1,C=0

A=0,B=0,C=1

A=1,B=1,C=1

8. Simplify a.b+a’.c+b.c using law of Boolean algebra [2]