BOOLEAN ALGEBRA

1 MARK QUESTIONS
1. Write the Sum of Product form of the function F (P,Q,R) for the following truth table representation of F:
P Q R F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

2. Write the Product of Sum form of the function F(X,Y,Z) for the following truth table representation of F:
X Y Z F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

3. Write the Product of Sum of the function G(U,V,W) for the following truth table representation of G:
U V W G
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

4. Write the Product of Sum form of the function G (U, V, W) for the following truth table representation of G:
U V W G(U, V, W)
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0

5. Write the Sum of Product form of the function F(A, B, C) for the following truth table representation of F:
A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
 1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

6. Write the POS form of boolean function G, which is represented in a truth table as follows:

A B C G
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

7. Write the SOP form of Boolean function F, which is represented in a truth table as follows:

X Y Z F
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

8. Write the POS form of a boolean function F, which is represented in truth table as follows:

A B C F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

9. Write the SOP form of a boolean function F, which is represented in a truth table as follows:

A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
10. Write the SOP form of a boolean function F, which is represented in a truth table as follows:

X Y Z F(X, Y, Z)
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

11. Write the POS form of boolean function H, which is represented in a truth table as follows:

X Y Z H
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

12. Write the SOP form of boolean function G, which is represented in truth table as follows:

P Q R G
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

13. Write the POS form of boolean function H, which is represented in a truth table as follows:

A B C H
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

14. Write the POS form a boolean function G, which is represented in a truth table as follows:
 u v w G
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

15. Draw a logic circuit diagram for the boolean expression: X.(Y + Z)
16. Draw a logic circuit diagram for the boolean expression: A.(B+C)

17. Draw a logic circuit diagram for the boolean expression: A.(B+C)

18. Prove that X . (X + Y) = X by truth table method.

19. Find the complement of the following Boolean function:

F1 = AB’ C’D’
20. In the Boolean Algebra, verify using truth table that X + XY for each X, y in (0, 1).

21. In the Boolean Algebra, verify using truth table that (X + Y)’ + X’Y’ for each X’ Y in (0, 1).

22. Give the dual of the following result in Boolean Algebra

X . X’ = for each X.
23. Define the followings:
(a) Minterm (b) Maxterm (c) Canonical form

24. Interpret the following logic Circuit as Boolean expression:

25. Interpret the following Logic Circuit as Boolean Expression:

26. Write the dual of the Boolean expression A + B’ .C.

27. Write the dual of the Boolean expression (B’ + C) . A.
28. Represent the boolean expression X (Y’ + Z) with help of NOR gates only.
29. State Demorgan’s Laws:
30. Which gates are called Universal gates and why?
2 Marks Questions

1. Name the law shown below and verify it using a truth table.
A + B. C = (A + B) .(A + C)
2. Obtain the Boolean expression for the logic circuit shown below:

Name the law shown below and verify it using a truth table.
X + X’. Y = X + Y
3 Obtain the Boolean expression for the logic circuit shown below:

4 Verify the following using boolean laws

X + Z = X + X’.Z + Y.Z
5 Verify the following using boolean laws
A + C = A + A’.C + B.C
6 Obtain the Boolean expression for the logic circuit shown below:

7 State DeMorgan’s laws. Verify one of the DeMorgan’s laws using a truth table.
8 Draw a logic circuit for the following boolean expression.
A.B’ +(C +B’) .A’
9 Obtain the Boolean expression for the logic circuit shown below:

10 Verify the following using boolean expression using truth table:

(i) X+0=X
(ii) X + X’ = 1
11 Write the equivalent Boolean expression for the following logic circuit:

12 Verify the following boolean expression using truth table:

(i) X . X’ = 0 (ii) X + 1 = 1
13 Write the equivalent boolean expression for the following logic circuit:

14 Verify the following boolean expression using truth table:

u. (u’ + v) = (u + v)
15. Write the equivalent boolean expression for the following logic circuit:

16. Verify the following boolean expression using truth table:

X + Y .Z = (X + Y) . (X +Z)

17. Write the equivalent boolean expression for the following logic circuit:

18. State and prove DeMorgan’s laws in boolean algebra.

19. Write the equivalent boolean expression for the following logic circuit:

20. Write the equivalent boolean expression for the following logic circuit:
21. Verify the following algebraically:
X’.Y + X . Y’ = (X’ + Y’) . (X + Y)

22. Verify the following algebraically:

(A’ + B’) . (A + B) = A’.B + A . B’

23. Write the equivalent boolean expression for the following logic circuit:

24. Write the equivalent boolean expression for the following logic circuit:

25. Verify X’.Y + X . Y’ + X’.Y’ = (X’ + Y’) using truth

table.

26. Write the equivalent boolean expression for the following logic circuit:

27. Represent (P + Q’. R) in POS form.

28. State the verify absorption law in boolean algebra.

29. Convert the following boolean expression into its equivalent canonical Sum of Product (SOP) form:
(X’+Y + Z’).(X’+Y + Z).(X’+Y’+Z).(X’+Y’+Z’)

30. Convert the following boolean expression into the equivalent canonical product of Sum (POS) form.
A. B’ .C + A’ .B.C + A’.B.C’

31. State and verify distributive law in boolean algebra.

32. Convert the following boolean expression into its equivalent canonical Sum of Product (SOP):
(u’ + v + w’).(u + v’ + w’).(u + v + w)

33. Given the following truth table, write the sum of products from of the function F (x, y, z):
x y z F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
 1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
34. Prove the algebraically x’ y ‘ z’ + x’ y’ z + x’ yz’ + x’yz’ + xy’z’ + xy’z = x’ + y’.
35. Convert X + Y to minterms
36. Convert the following three input F denoted by the expression F = ∑ (0, 1, 2, 5) into its canonical
Sum-of-Products form.
37. Simplify ABCD + ABCD + ABCD + ABCD.
38. Provide that X. (X + Y) = X by algebraic method.
39. Verify X . Y’ + Y’ .Z = X. Y’ .Z’ + X .Y’ .Z’ + X’ .Y’ .Z algebraically.
40. Perform the following:
(a) State and prove the De Morgan’s Theorem (Any One) Algebraically.
41. State and prove the absorption algebraically.
42. Given the following truth table, derive a Sum of Product (SOP) and Product of Sum (POS) form
of Boolean expression from it:
X Y Z G (X, Y ,Z)
0 0 0 0
0 0 1 1
0 1 0 1
0 1 0 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

43. Given the following truth table, derive a sum of product (SOP) and Product of Sum (POS) form of
Boolean expression from it.
A B C F (A, B ,C)
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

44. Represent the Boolean expression X. Y’ + Z with the help of NOR gates only.
45. Represent the Boolean expression (X + Y’) .Z with the help of NAND gates only.
3 Marks Questions

1. Obtain the minimal form for the following boolean expression using Karnaugh’s Map:
F(A, B, C, D) = ∑(1, 4, 5, 9, 11, 12, 13, 15)

2. Obtain the minimal form for the following boolean expression using Karnaugh’s Map:
F(A, B, C, D) = ∑(1, 3, 4, 5, 6, 7, 12, 13)
3. Obtain a simplified form for the following boolean expression using Karnaugh’s Map:
F(P, Q, R, S) = ∑(0, 2, 4, 5, 6, 7, 8, 10, 13, 15)

4. Obtain the minimal form for the following boolean expression using Karnaugh’s Map:
H(P, Q, R, S) = ∑(0, 1, 2, 3, 5, 7, 8, 9, 10, 14, 15)

5. Obtain the minimal form for the following boolean expression using Karnaugh’s Map:
F(U, V, W, Z) = ∑(0, 1, 2, 3, 6, 7, 8, 9, 10, 13, 15)

6. Reduce the following boolean expression using K-map:

F(P, Q, R, S) = ∑(1, 2, 3, 4, 5, 6, 7, 8, 10)

7. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(2, 3, 4, 5, 6, 7, 8, 10, 11)

8. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(0, 1, 2, 4, 5, 6, 8, 10,)

9. Reduce the following boolean expression using K-map:

F(P, Q, R, S) = ∑(0, 1, 2, 4, 5, 6, 8, 12)

10. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(3, 4, 5, 6, 7, 13, 15)

11. Reduce the following boolean expression using K-map:

F(u, v, w, z) = ∑(3, 5, 7, 10, 11, 13, 15)

12. Reduce the following boolean expression using K-map:

F(P, Q, R, S) = ∑(1, 2, 3, 5, 6, 7, 9, 11, 12, 13, 15)

13. Reduce the following boolean expression using K-map:

H(u, v, w, z) = ∑(0, 1, 4, 5, 6, 7, 11, 12, 13, 14, 15)

14. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(0, 1, 2, 3, 6, 7, 8, 11, 14, 15)

15. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(0,2, 3, 4, 6, 7, 8, 10, 12,)

16. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(0, 1, 2, 4, 5, 8, 9, 10, 11,)

17. Reduce the following boolean expression using K-map:

F(A, B, C, D) = ∑(1, 3, 4, 5, 7, 9, 11, 12, 13, 14)

18. If F (a, b, c, d) = ∑ (0, 2, 4, 5, 7, 8, 10, 12, 13, 15), obtain the simplified form using K-Map.
19. What is the simplified Boolean equation for the following K-map.
20. Minimise the following function using a Karnaugh map.
F (W, X, Y, Z) = ∑ (0, 4, 8, 12).
21. Obtain the simplified form a Boolean expression:
F (u, v, w, z) = ∑ (0, 1, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15)
using Karnaugh Map.
22. Obtain a simplified form for a Boolean expression
F (x, y, z, w) = ∑ (0, 1, 3, 4, 5, 6, 7, 9, 10, 11, 13, 15)
using Karnaugh Map.