QNO 6(A)
01.(a)State DeMorgan's Law. Verify one of the Demorgan’s Laws using truth tables.
1998
02.(a)State the distribute law. Verify the law using truth table.
1999
03.(a) State Absorption Laws. Verify one of the Absorption Laws using truth tables.
2000
04.(a) State and verify Involution law.
2001
05.(a) State the associative law and verify the law using truth table.
2002
06.(a) State and prove the absorption law algebraically.
2004
07.(a) State and verify Associative law in Boolean Algebra.
2005
08.(a) State Distributive law and verify the same using truth table.
2007
09.(a) Verify X‟Y + X.Y‟ + X‟.Y‟ = (X‟+Y‟) using truth table.
2009
10.(a) Verify the following algebraically.
2010
(A’+B’).(A+B) = A’.B’+A.B’
11.(a) Verify the following using Truth Table.
2011
U.(U‟ + V) = (U+V)
12.(a) Verify the following using Truth Table.
2012
(i) X.X’ = 0
(ii) X+1 = 1
13.(a) State and algebraically verify Absorbtion Laws.
SP 1
1
14.(a) State and verify Demorgan’s Laws.
S.P.2
15.(a) State and verify Demorgan's Laws algebraically.
S.P.3
16. (a) Verify the following algebraically.
2013 SP 1
(A’+B’).(A+B)=A’.B+A.B’
17. (a)Verify the law using truth table
X+(Y+Z) = (X+Y)+Z
2013 SP 2
18. (a) State and Verify Distributive Law. Verify using Truth Table.
2013 SP 3
19. (a) Verify X’.Y+X.Y’=(X’+Y’).(X+Y) algebraically.
2013 SP 4
QNO 6(B)
01. (b) Prove X'Y + Z = (X' + Y' + Z)(X’ +Y+Z)(X+Y + Z) algebraically.
1998
02. (b) Prove: X + X'Y = X + Y algebraically.
1999
03. (b) Prove: X'.Y+Y’.Z = X'.Y.Z + X'.Y’.Z’ + X.Y’.Z + X'.Y'.Z algebraically.
2000
04. (b) Prove algebraically: X.Y + X‟.Z +Y.Z = X.Y + X‟.Z
2001
05. (b) Prove: XY+ YZ + YZ' = Y
2002
06. (b) Given the following truth table, derive a sum of product (SOP) and Product of
Sum (POS) form of Boolean expression from it :
2004
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
F(A,B,C)
1
1
0
1
0
1
1
0
2
07. (b) Write the equivalent Boolean expression for the following Logic Circuit :
2005
08. (b) Write the equivalent Canonical Sum of Product expression for the following
Product of Sum Expression.
2007
F(X,Y,Z) =  (1,3,6,7)
09. (b) Write the equivalent Boolean Expression for the following Logic Circuit:
2009
3
10. (b) Write the equivalent Boolean Expression for the following Logic
circuit :
2010
11. (b) Write the equivalent Boolean Expression for the following Logic Circuit.
2011
12. (b) Write the equivalent Boolean Expression for the following Logic Circuit.
2012
4
13. (b) Write the equivalent Boolean Expression for the following Logic Circuit.
SP 1
14. (b) Write the equivalent Boolean Expression for the following Logic Circuit.
SP 2
15. (b) Write the equivalent Boolean Expression for the following Logic Circuit.
SP 3
16. (b) Draw a logical Circuit Diagram for the following Boolean Expression:
A.(B+C’)
2013 SP 1
17. (b)Draw the logic circuit for F=AB' + CD'
2013 SP 2
18. (b) Represent the Boolean expression YZ+XZ with the help of NAND gates only.
2013 SP 3
5
19. (b) Convert the following Boolean expression into its equivalent Canonical Product
of Sum form:
2013 SP 4
X.Y’.Z+X’.Y.Z+X’.Y.Z’
QNO 6(C)
01.(c) Write the dual of the Boolean expression (U+ W) (V'U + W)
1998
02.(c) Write the dual of the Boolean expression (x+y).(x'+y')
1999
03.(c) Obtain simplified form for a Boolean expression using Karnaugh Map.
2000
F (x,y,z,w) = Σ(1,3, 4, 5, 7, 9,11, 12, 13, 15).
04.(c) If F(a, b, c, d) = Σ(0, 2, 4, 5, 7, 8, 10, 12, 13, 15), obtain the simplified form using
K-Map.
2001
05.(c) Obtain the simplified form of a Boolean expression using Karnaugh map.
2002
F(x,y,z) = Σ (2, 3, 6, 7)
06.(c) Obtain a simplified form for the following Boolean Expression using Karnaugh’s
Map :
2004
F(a, b, c, d) = Σ (0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 14)
07.(c) Write the SOP form of a Boolean Function F, which is represented by the
following truth table:
2005
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
F
1
0
0
1
0
0
1
1
6
08.(c) Write the equivalent Boolean Expression for the following Logic Circuit.
2007
09.(c) Write the POS form of a Boolean Function H, which represented in a truth table
as follows:
2009
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
H
0
1
1
1
1
0
0
1
10.(c) Write the POS form of Boolean function H, which is represented in a truth table
as follows :
2010
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
H
1
0
1
1
1
0
0
1
7
11.(c) Write the POS form of a Boolean function F, which is represented in a truth table
as follows:
2011
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
F
0
1
1
0
1
0
0
1
12. (c) Write the POS form of a Boolean function F, which is represented in a truth table
as follows:
2012
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
F
1
0
1
0
1
0
0
1
13.(c) Write the SOP form of a Boolean function G, which is represented in a truth table
as follows:
SP 1
P
0
0
0
0
1
1
1
1
Q
0
0
1
1
0
0
1
1
R
0
1
0
1
0
1
0
1
G
0
0
1
0
1
0
1
1
8
14.(c) Write the POS form of a Boolean function F, which is represented in a truth table
as follows:
SP 2 & 3
U
0
0
0
0
1
1
1
1
V
0
0
1
1
0
0
1
1
W
0
1
0
1
0
1
0
1
F
1
0
1
0
1
0
1
1
15. (c) Write the equivalent Canonical Sum of Product for the following Product of Sum
Expression:
F(X,Y,Z)=  (1,3,6,7)
2013 SP 1
16. (c) Derive the POS form of Boolean expression from the given truth table.
2013 SP 2
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
F(A B C)
1
1
0
1
0
1
1
0
17. (c)Obtain simplified form for a Boolean expression
F(x,y,z,w) = Σ(1,3,4,5,7,9,11,12,13,15) using K Map
2013 SP 3
9
18. (c)Write the equivalent Boolean Expression F for the following:
2013 SP 4
circuit diagram :
QNO 6 (D)
1.(d) Obtain a simplified form for a Boolean expression using K-Map.
F(u,v,w,z) = Σ(0,1, 3, 5, 7, 9,10,11,12, 13,15)
1998
2.(d) Minimize F(w,x,y,z) Karnaugh map.
F(w, x, y, z) =Σ(0, 4, 8, 12)
1999
3. (d) Draw the logic circuit for a half adder.
2000
4. (d) Represent NOT using only NOR gate(s).
2001
5. (d) Draw a logic circuit of full Adder.
2002
6. (d) Draw the logic circuit for a Half Adder using NAND gates only.
2004
7. (d) Reduce the following Boolean expression using K - Map:
F(A, B, C, D) =  (O, 1, 2, 3, 4, 5, 10, 11, 15)
2005
8. (d) Reduce the following Boolean expression using K-Map:
F(U,V,W,Z) = Σ (0, 1, 2, 3, 4, 10, 11)
2007
9. (d) Reduce the following Boolean Expression using K-Map:
F(P, Q, R, S) = Σ (1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 15)
2009
10
10. (d) Reduce the following Boolean expression using K-map:
2010
F(U,V,W,Z)= (3,5,7,10,11,13,15,)
11. (d) Reduce the following Boolean Expression using K-Map :
F(P, Q, R, S) = Σ (0, 1, 2, 4, 5, 6, 8, 12)
2011
12. (d) Reduce the following Boolean Expression using K-Map :
F(A,B,C,D)= Σ (2,3,4,5,6,7,8,10,11)
2012
13. (d) Reduce the following Boolean Expression using K-Map:
F(U,V,W,Z)= (0,1,2,4,5,6,8,10)
SP 1
14.(d) Reduce the following Boolean Expression using K-Map:
F(A,B,C,D)= Σ (0,1,2,4,5,6,8,10)
SP 2
15.(d) Reduce the following Boolean Expression using K-Map:
F(A,B,C,D)= (0,1,2,4,5,6,8,10)
SP 3
16. (d) If F (X, Y, Z, W) = Σ (1,3,4,5,7,9,10,11,13,15 ) obtain the simplified
form using K-Map.
2013 SP 1
17. (d) Reduce the following Boolean expression using K map
F(M,N,O,P)= _(0,1,3,4,5,6,7,9,10,11,13,15)
2013 SP 2
11