1. State and Explain the DeMorgan’s Theorem and Consensus Theorem.

2. Simplify the Boolean expression using K-MAP

F(A,B,C,D) = ∑m(1,2,3,8,9,10,11,14) +d(7,15)

3. Determine the minimal sum of product form of

a) f(w,x,y,z)=∑m(4,5,7,12,14,15) +d(3,8,10)

b) F(A,B,C,D)=πM(0,3,5,6,8,12,15)

4. Simplify the Boolean expression using K-map and implement using NAND gates

F(A,B,C,D) = ∑m(0,2,3,8,10,11,12,14)

5. Implement AND, OR, NOR by using NAND gates only.

6. Explain with neat logic diagram and truth table of the functioning of basic logic gates.

7. Write a brief note on Gray codes. Also discuss methods for conversion from gray to

binary code and vice versa.