86 Digital Circuits and Design

3.
What are the applications of Boolean algebra?
4.
Define the truth table.
5.
How is the AND multiplication different from ordinary multiplication?
6.
How does OR addition differ from the ordinary addition method?
7.
What are the basic laws of Boolean algebra?
8.
State and prove Absorption and Simplification theorems.
9.
State and prove Associative and Distributive theorems.
10.
What is meant by duality in Boolean algebra?
11.
State DeMorgan’s theorem.
12.
State and explain the DeMorgan’s theorems which convert a sum into a product form and vice versa.
13.
Explain the terms: (a) prime implicant, (b) input variable, (c) minterm and (d) maxterm.
14.
Prove DeMorgan’s theorem for a 4-variable function.
15.
Many cars produced in Japan have an interlock system that allows the engine to start only if both the front
seat occupants have their seat-belts on. Construct a truth table to indicate whether the car may be started
based upon whether a passenger is present and whether both the passenger and the driver have buckled
their seat-belts.
16. Draw a truth function table for a person crossing a river based upon whether (i) the river is frozen over,
(ii) the boat leaks, and (iii) the person can swim.

Problems
__ __ __
1. Indicate whether Y is a 0 or a 1 in the equation Y = A ​​ ​  B ​​ C​ + AB, under the following conditions:
(a) A = 1, B = 0, C = 1; (b) A = 0, B = 1, C = 1;
(c) A = 0, B = 0, C = 0
Ans:  (a) 0, (b) 0, (c) 0
2. Simplify the followig expressions:
__ __ __ __ __ __ __ __ __
(a) A​B ​​ C​ + A​ ​
​  B ​​ C​ + A​
​  BC​
​  + A​ ​
​  B​ C
__ __ __ __ __ __ __ __ __ __
(b) ABC + A​ ​  BC + A​B​ C + AB​C​ + A​B​ ​ C​ + A​ ​  BC​
​  + A​ ​
​  B​ ​ C​ 
__ __ __
(c) A(A + B + C) · (​A​ + B + C) · (A + B​ ​  + C) · (A + B + C​ ​  )
__ __ __ __
(d) (A + B + C) · (A + B​ ​  + C​
​  ) · (A + B + C​
​  ) · (A + B​
​  + C)
__ __ __ __ __ __ __
Ans:  (a) B​ ​
​  C​ + A​ ​
​  C​ + A​ ​
​  B​ , (b) A + B + C​
​ , 
(c) A(B + C), (d) A is a minimal expression.
3. Draw a truth table for the equations given below:
__ __
(a) Y = AC + AB, (b) Y = A(​B​ + C​​  )
4. Draw a truth table for the equations given below:
__ __
(a) Y = AB(B + C + D​ ​  ) (b) Y = (A + B + C)​A​ B
(c) Y = ABC(C + D) (d) Y = AB + BA + C(A + B)
5. Reduce the following Boolen expressions:
__
(a) ABC(ABC + 1) (b) A + A​​  + B + C
(c) AAB + ABB + BCC (d) AB + B + A + C
Ans:  (a) ABC, (b) 1, (c) AB + BC,  (d) A + B + C
6. Reduce the following Boolen expressions:
__ __
(a) AB + BB + C + B​ ​   (b) A(​A​ + B)
(c) AB(B + C) (d) ABB(ABC + BC)
(e) (AB + C)(AB + D)
Ans:  (a) 1, (b) AB, (c) AB, (d) ABC, (e) AB + CD
7. Reduce the given Boolen expressions:
__ __ __ __ __
(a) A​B​ C + A​ ​
​  B​ C (b) A​B​ C + A​
​  BC + ABC
__
(c) (​A​ B)(AB) + AB (d) (1 + B)(ABC)
 Boolean Algebra and Minimization Techniques 87
__ __ __
(e) (A​B​ + A​C​ )(BC + B​C​ )(ABC) __
Ans:  (a) B​
​C
  (b) AC + BC, (c) AB (d) ABC, (e) 0
8. Reduce the given Boolen expressions:
__ __ _____ __
(a) A + B​
​  C(A + B​
​  C) (b) A(​ABC​ + A​B​C
  )
______________
_________
_____ __ ________
(c) ​ABC​
​   +​A​ B 
​  
+ BC​ (d) A[B + C(​AB + AC​ 
)]
__ __ __ __ __
Ans:  (a) A + B​
​ C
  (b) A(​B​ + C​
​  ) (c) B​
​  + C​
​  ,  (d) AB
9. Derive the complements of the expressions given below:
(a) (A + BC + AB) (b) (A + B)(B + C)(A + C)
__ __
(c) AB + BC + CD (d) AB(​C​ D + B​
​  C)
__ __
(e) A(B + C)(​C​ + D​
​  )
__ __ __ __ __ __ __ __ __ __ __ __ __ __ __
Ans:  (a) A​
​  (B​
​  + C​
​  ) (b) A​ ​
​  B​ + B​ ​
​  C​ + A ​​
_____​  C​ (c)​A​ ​ C​
__ + B ​​
​__ C​
__ + B​ ​
​  D​ 
(d) ABD​
​  + C (e) A​ ​  + B​ ​
​  C​ + CD
10. Simplify each of the following expressions:
__ __ __
(a) Y = RST + RS + (​T​ + V) (b) Y = (M + N)(​M​ + P)(​N​ + P) __
Ans:  (a) RS + T​
​  + V (b) P (M + N)
11. Using Boolean techniques, simplify the given expressions:
__ ___
(a) AB + A(B + C) + B(B + C) (b) AB(C + B​D​ ) + AB​
​   ______
__
Ans:  (a) B + AC, (b) AB​
​ C​ D 
​­
12. Simplify the following expressions:
__ __
(a) A + AB + A​B​ C (b) (​A​ + B)C + ABC
__ __
(c) A​B​ C(BD + CDE) + A​C​ 
__ __ __
Ans:  (a) A, (b) C(​A​ + B) (c) A(​C​ + B​
​ D
  E)
13. Apply DeMorgan’s theorem to each of the given expressions:
_______ ___ ___
(a) ​A(B + C​ 
) (b) ​AB​ + CD​
​  
________ __ __ __
(c) ​AB + CD​   (d) (A + B​
​  )(​C​ + D​
​  )
__ __ __ __ __ __ __ __ __ __ __ __ __
Ans:  (a) A​
​  + B​ 
​  · ​C​ (b) A​
​  + B​
​  + C​
​  + D​
​  (c) (​A​ + B​
​ )  (​C​ + D​
​  ) (d) A​
​  B + C​D​ 
14. Apply DeMorgan’s theorem to the given expressions:
___________
__ __ ___________
(a) ​A​B​ + (C + D​​
​   
) (b) ​AB(CD +   EF​)
____________
__ __ _______
__ ______________________
____________
__ ______
__ __
(c) (​A + B​
​  + C  + D​​
​  ) + ABC ​
​ D​  
​ (d) (​A​
​  + B + C  
+   
D​) + A​
​ B​ ​ C​ D ​​
____________________
___ __ ___ ___
(e) ​AB​
​  (CD + E​ ​  F)(​AB​
   + CD​​
​ ) 
__ __ __ __ __ __ __ __
Ans:  (a) (​A​ + B)​C​ D (b) (​A​ + B​ ​  ) + (​C​ + D​
​  ) · (​E​ + F​
​ ) 
______ __ __ __ __ __ __
(c)​ABC​D​​   (d) A​B​ ​ C​D
  (e) AB + (E + F​ ​  ) + (​C​ + D​​  )
15. Simplify the given expressions using the Boolean Algebra method
__ __ __ _________
__ __ ____
(a) BD + B(D + E) + D​​  (D + F) (b) ​A​ ​ B​ C + (​A + B + C​​
​ )  
+ A​ ​
​  B ​​C​
  D 
__ ___ ___
(c) (B + BC)(B + B​
​ C  )(B + D) (d) ABCD + AB(​CD​  ) + (​AB​ )CD
__
(e) ABC AB + ​C​ (BC + AC)
__ __ __
Ans:  (a) BD + BE + D​ ​  F (b) A​ ​
​  B​(  C + D) (c) B (d) AB + CD
(e) ABC
16. Give a Boolean expression for the following statements:
(a) Y is a 1 only if A is a 1 and B is a 1 or if A is a 0 and B is a 0.
(b) Y is a 1 only if A, B and C are all 1s or if only one of the variables is a 0.
__ __ __ __ __
Ans:  (a) Y = AB + A​ ​
​  B​ (b) Y = ABC + A​ ​  BC + A​B​ C + AB​C​ 
 88 Digital Circuits and Design

17. Simplify the following logic expressions:

__ __ __
(a) (​A​ + B + C​​ )  (​A​ + B + D + E)(C + D)
__ __
(b) F = A​ ​
​  B​ C + BC + AC __ __
Ans:  (a) (​A​ + B)(C + D) + C​ ​  D (b) C.
18. Simplify the following expressions using the simplification theorem.
__ _____ ____________
(a) A + A​
​  B + (​A + B​ 
)C + (​A + B + C  + D​)
__ __
(b) A​B​ + AC + BCD + D​ ​  ) __ __ __
Ans:  (a) A + B + C + D​​  (b) A​B​ + BC + D​​  
19. Using the absorption theorem, simplify the following expressions:
__ __ __ __ __ __ __ __ __ _________
(a) A + A​ ​
​  B​ + BC​D​ + B​D​   (b) A​B​ C + (​B​ + C​
​  )(​B​ + D​
​  ) + A
​ + C + D​  __ __ __ ___
Ans:  (a) A + B​​  + D​
​  (b) B​
​  + CD​
​  
20. Prove the following using Boolean theorems:
(a) (A + C)(A + D)(B + C)(B + D) = AB + CD
__ __ __ __ __ __ __ __ __ __ __ __
(b) (​A​ + B​ ​  + D​​  ) (​A​ + B + D​ ​  ) (B + C + D)(A + C​
​  ) (A + C​
​  + D) = A​ ​
​  C​ D + AC​D​ + B​C​ ​ D​ 
21. Find the complements of the given expressions:
__ __
(a) A​B​ + A​ ​B 
__ __
(b) (​V​  W + X)Y + Z​ ​ 
__ __ __ __ __ __
(c) WX(​Y​  Z + Y ​Z​)  + W​ ​   X​
​  (Y​
​  + Z)(Y + Z​ 
​  )
__ __ __ __ __
(d) (A + B​ ​  + C)(​A​ ​ B​ + C) (A + B​ ​ ​  C​) 
__ __ __ __
(e) ​X​  Y ​Z​ + X​ ​
​  Y​ Z
__ __
(f) X(​Y​  ​Z​  + YZ)
__ __ __ __ __
(a) (​A​ + B)(A
Ans:  __ __ __+ B​
​ )  (b) ((V + W​
​ )  X​
​ __ + Y ​
​ __)  Z
(c) [W + X​
​  + (Y + Z​ 
​  ) (​Y​ + Z)] [W + X + Y​Z​ + Y​ ​Z
  ]
__ __ __ __
(d) A​ 
​  BC​​  + (A + B) C​ ​  + A​
​  (B + C)
__ __ __ __ __
(e) (X + Y​
​  + Z)(X + Y + Z​  ​  ) (f) X​
​  + (Y + Z)(​Y​ + Z​ 
​  )
22. Simplify the following Boolean expressions to a minimum number of literals:
________
(a) A(B + C(​AB + AC​)  )
__ __
(b) (​U​  ​V​ + W)’ + W + UV + UW
__ __
(c) ​A​(  A + B) + (B + AA)(A + ​B​) 
__ __ __
(d) (X + Y​ ​  + XY) (X + Y​ 
​  ) (​X​  Y)
__
Ans:  (a) AB (b) U + V + W (c) A + B (d) 0
__ __
23. (a) Convert f = ABCD__+ A​
​B
  C + ​B​ ​ C​ into a sum of minterms by algebraic method.
(b) Convert f = AB + B​ ​C  D into a product of maxterms by algebraic method.
__ __ __ __ __ __ __ __ __ __ __ __ __ __ __
Ans:  (a) f = ABCD + A​ ​  BCD + A​B​ ​ C​ D + A​​  BC​D​ + A​ ​ ​  B​ ​ C​ D + A​B​ ​ C​ ​ D​ + A​ ​
​  B​ ​ C​ ​ D​ 
__ __ __
(b) f = (A + B + C + D)(A + B + C + D​ ​  )(A + B + C​ ​  + D)(A + B​ ​  + C + D)
__ __ __ __ __ __ __ __
(A + B​ ​  + C + D​
​  )(A + B​ ​  + C​
​  + D)(A + B​ ​  + C​​  + D​​  )(​A​ + B + C + D)
__ __ __ __
(​A​ + B + C + D​ ​  )(​A​ + B + C​ ​  + D)
24. Obtain the canonical sum of products and product of sums of the following expression:
f = x1x2x3 + x1x3x4 + x1x2x4
_ _ _
Ans:  f = x1x2x3x4 + x1x2x3x​ ​  4 + x1x2x​​  3x4 + x1​x​ 2x3x4
[Canonical SOP]
_ _ _ _
f = (x1 + x2 + x3 + x4)(x1 + x2 + x3 + x​ ​   )(x + x + x​ ​  3 + x4)(x1 + x2 + x​ ​  3 + x​
​  )
_ _ _4 1 _ 2 _ _4
(x1 + x​ ​  2 + x3 + x4)(x1 + x​
​  2 + x3 + x​
​  4)(x1 + x​ ​  2 + x3 + x4)(x1 + x​ ​  2 + x3 + ​x​ 4)
_ _ _ _ _ _ _
(​x​1  + x2 + x3 + x4)(​x​1  + x2 + x3 + x​ ​ 4  )(​x​1  + x2 + x​ ​ 3  + x4)(​x​1  + x​ ​ 2  + x3 + x4)
[Canonical POS]
 Boolean Algebra and Minimization Techniques 89

25. using the K-map method, simplify the following function, obtain their (i) minimum sum of products,
and (ii) minimum product of sums form.
f(w, x, y, z) = S (1, 3, 4, 5, 6, 7, 9, 12, 13)
f(w, x, y, z) = S(1, 5, 6, 7, 11, 12, 13, 15)
__ __ _ _ __ _
Ans:  (a) f = ​w​z  + ​w​x  + y​ ​ z  + x​y​ (ii) f = (​w​ + y​ ​  )_____
(x + z)
(b) (i) f = x(w ≈ y) + z(​w ≈ y​) 
__ _ __ _
(ii) f = (w + y + z)(​w​ + x + y)(w + x + y​ ​  )(​w​ + y​ ​  + z)
26. Using the Quine McCluskey method and K-map method, obtain the minimal sum of product expression
of the followig function.
Y = S(0, 2, 3, 6, 7, 8, 10, 11, 12, 15) __ __ __ __ __
Ans:  Y = A​ ​ C  + CD + B​ ​ ​  D​ + A​C​ ​ D​ 
__ __
27. Determine the don’t care condition
__ in the following
__ __ Boolean
__ __ __ expression
__ __ __ BE + B​ ​  DE​​  which is a simplified
version of the expression A​ ​  BE + BCDE + B​C​ ​ D​ E + A​ ​
​  B​ DE​
​  + B​ ​
​  C​ DE​​ 
Ans:  don’t care combinations:
__ __ __ __
A​B​ CD​E​ + AB​C​ DE + ABC​D​ E
28. Using the Quine McCluskey method and K-map method, simplify the following functions into minimal
sum of products:
f(u, w, x, y, z) = (0, 2, 5, 7, 9, 11, 13, 15, 16, 18, 21, 23, 25, 27, 29, 31)
__ _ _
Ans:  f = wz + xz + w​ ​   x​
​   z​ 
​ 
29. A corporation having 100 shares entitles the owner of each share to cast one vote at the share-holders’
meeting. Assume that A has 40 shares, B has 30 shares, C has 20 shares and D has 10 shares. A two-third
majority is required to pass a resolution in a share-holders’ meeting. Each of these four men has a switch
which he closes to vote YES and opens to vote NO for his percentage of shares. When the resolution
is passed the output, LED must be ON. Derive a truth table for the output function and give the sum of
product equation for it. __ __ __ __ __
Ans:  f = AB​C​ ​ D​ + A​B​ CD + ABC​D​ + AB​C​ D + ABCD = AB + ACD
30. (a) Express the following function as a product of maxterms f = S(1, 3, 5, 7)
(b) Express the complement of the function as a sum of minterms.
(c) Express the complement of the function as a product of maxerms.
__ __ __
Ans:  (a) (A + B + C)(A + B​ ​  + C)(​A​ + B + C)(​A​ + B + C)
__ __ __ __ __ __ __ __
(b) A​ ​​  B​ ​ C​ + A​
​B ​  + A​B​ ​ C​ + AB​C​ 
  C​
__ __ __ __ __ __ __ __
(c) (A + B + C​ ​  )(A + B​ ​  + C​ ​  )(​A​ + B + C​ ​  )(​A​ + B​ ​  + C​ ​  )
31. Prepare Karnaugh maps for the following functions:
__ __ __ __ __
(a) f = ABC + A​ ​  BC + B​ ​
​  C​ (b) f = A + B + ​C​ (c) f = AB + B​ ​  CD
f(u, w, x, y, z) = S(0, 2, 5, 7, 9, 11, 13, 15, 16, 18, 21, 23, 25, 27, 29, 31)
__ _ _
Ans:  f = wz + xz + w​ ​ ​  x​ ​ z​ 
32. Find the minimal sum of products for the Boolean expression, f(u, w, x, y, z) = S(0, 1, 2, 3, 8, 9, 16, 17,
20, 21, 24, 25, 28, 29, 30, 31), using the Quine–McCluskey method. __ __ __ __ __ __
Ans:  C​ ​ ​  D​ + A​D​ + ​A​  B​ ​   C​
​  + ABC
33. Find the minimal sum of products for the Boolean expression, y = Sm(0, 1, 5, 11, 14, 16, 17, 21) + Sd(4,
15, 20, 30, 31), using the Quine–McCluskey method. __ __ __
Ans: ​B​  D​ ​  + BCD + A​ ​  BDE
34. Using the K-map method, simplify the following functions,
(a) F(A, B, C, D, E, F) = S(0, 4, 5, 7, 8, 12, 16, 20, 21, 23, 24, 26, 28, 37, 39, 53, 55, 58, 61)
(b) F(A, B, C, D, E, F) = Sm(1, 3, 5, 7, 10, 13, 17, 19, 24, 33, 35, 37, 49, 51, 57, 59, 61, 63)
+ Sd (8, 15, 26, 45, 47) __ __ __ __ __ __ __
Ans: 
__ (a)__A​ ​   E​
​__  F​
​  + C​ ​  DF + BC​ __D​ ​  + ABD​
__ EF​ __ __ E​ F
(b) C​D​ F + A​ ​   C ​D​  F + ABCF + A​ ​   B​
​  DF + B​ ​   D ​E​  F