Problems Chapter 7 – Boolean Representation
1. Express the Boolean the function F = A + B’C as a sum of minterms
2. Demonstrate the validity of the following identities by means of truth tables:
(a) DeMorgan’s theorem for three variables: ̅̅̅̅̅̅̅̅̅̅̅̅ ̅. 𝒚
𝒙+𝒚+𝒛=𝒙 ̅. 𝒛̅ and 𝒙.
̅̅̅̅̅̅̅̅ ̅+
𝒚. 𝒛 = 𝒙
̅ + 𝒛̅
𝒚
(b) The distributive law: x + yz = (x + y)(x + z)
(c) The distributive law: x(y + z) = xy + xz
(d) The associative law: x + (y + z) = (x + y) + z
(e) The associative law and x(yz) = (xy)z
3. Simplify the following Boolean expressions to a minimum number of literals:
(a) 𝒙𝒚 + 𝒙𝒚 ̅
(b) (𝒙 + 𝒚)(𝒙 + 𝒚 ̅)
(c) 𝒙𝒚𝒛 + 𝒙 ̅𝒚 + 𝒙𝒚𝒛̅
̅̅̅̅̅̅̅̅̅̅
(d) (𝑨 ̅̅̅̅̅̅̅̅̅
+ 𝑩). (𝑨̅+𝑩 ̅)
(e) (𝒂 + 𝒃 + 𝒄̅)(𝒂 ̅𝒃̅ + 𝒄)
̅ 𝒃𝒄 + 𝒂𝒃𝒄̅ + 𝒂𝒃𝒄 + 𝒂
(f) 𝒂 ̅𝒃𝒄̅
4. Simplify the following Boolean expressions to a minimum number of literals:
(a) 𝑨𝑩𝑪 + 𝑨 ̅ 𝑩 + 𝑨𝑩𝑪 ̅
(b) 𝒙̅𝒚𝒛 + 𝒙𝒛
(c) (𝒙̅̅̅̅̅̅̅
+ 𝒚)(𝒙̅+𝒚 ̅)
(d) 𝒙𝒚 + 𝒙(𝒘𝒛 + 𝒘𝒛̅)
(e) (𝑩𝑪 ̅+𝑨 ̅ 𝑫)(𝑨𝑩 ̅ + 𝑪𝑫̅)
̅ + 𝒄̅)(𝒂 + 𝒃
(f) (𝒂 ̅ + 𝒄̅)
5. Reduce the following Boolean expressions to the indicated number of literals:
(a) 𝑨̅𝑪̅ + 𝑨𝑩𝑪 + 𝑨𝑪 ̅ to three literals
(b) (̅̅̅̅̅̅̅̅̅̅
̅𝒚
𝒙. ̅ + 𝒛) + 𝒛 + 𝒙𝒚 + 𝒘𝒛 to three literals
̅ 𝑩(𝑫
(c) 𝑨 ̅ +𝑪 ̅𝑫) + 𝑩(𝑨 + 𝑨 ̅ 𝑪𝑫) to one literal
̅ ̅ ̅
(d) (𝑨 + 𝑪)(𝑨 + 𝑪)(𝑨 + 𝑩 + 𝑪𝑫) ̅ to four literals
(e) 𝑨𝑩𝑪 ̅𝑫 + 𝑨 ̅ 𝑩𝑫 + 𝑨𝑩𝑪𝑫 to two literals
6. Given the Boolean functions F1 and F2 , show that
(a) The Boolean function E = F1 + F2 contains the sum of the minterms of F1 and F2.
(b) The Boolean function G = F1F2 contains only the minterms that are common to F1
and F2.
7. Simplify the following Boolean functions T1 and T2 to a minimum number of literals:
Chapter -7 – Pages-1
8. Obtain the truth table of the following functions, and express each function in sum‐of‐
minterms and product‐of‐maxterms form:
(a) (𝑩 + 𝑪𝑫)(𝑪 + 𝑩𝑫)
(b) (𝑪𝑫 + 𝑩 ̅ 𝑪 + 𝑩𝑫 ̅ )(𝑩 + 𝑫)
̅ + 𝑫)(𝑩 + 𝑪
(c) (𝑪 ̅)
(d) (𝑩𝑫̅ + 𝑨𝑪𝑫 ̅ + 𝑨𝑩 ̅𝑪 + 𝑨 ̅)
̅𝑪
9. For the Boolean function
̅𝒛 + 𝒙
𝑭 = 𝒙𝒚 ̅ ̅𝒚𝒛 + 𝒘 ̅𝒚 + 𝒘𝒙𝒚
̅ 𝒙𝒚 + 𝒘𝒙
(a) Obtain the truth table of F.
(b) Draw the logic diagram, using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of literals.
(d) Obtain the truth table of the function from the simplified expression and show
that it is the same as the one in part (a).
(e) Draw the logic diagram from the simplified expression, and compare the total
number of gates with the diagram of part (b).
10. Express the following function as a sum of minterms and as a product of maxterms:
𝑭(𝑨, 𝑩, 𝑪, 𝑫) = 𝑩 ̅𝑫 + 𝑨 ̅ 𝑫 + 𝑩𝑫
11. Express the complement of the following functions in sum‐of‐minterms form:
(a) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟐, 𝟒, 𝟕, 𝟏𝟎, 𝟏𝟐, 𝟏𝟒)
(b) 𝑭(𝒙, 𝒚, 𝒛) = ∏(𝟑, 𝟓, 𝟕)
12. Convert each of the following to the other canonical form:
(a) 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟑, 𝟓)
(b) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∏(𝟑, 𝟓, 𝟖, 𝟏𝟏)
13. Convert each of the following expressions into sum of products and product of sums:
(a) (𝒖 + 𝒙𝒘)(𝒙 + 𝒖 ̅ 𝒗)
̅ + 𝒙(𝒙 + 𝒚
(b) 𝒙 ̅)(𝒚 + 𝒛̅)
14. Draw the logic diagram corresponding to the following Boolean expressions without
simplifying them:
(a) (𝑩𝑪̅ + 𝑨𝑩 + 𝑨𝑪𝑫)
(b) (𝑨 + 𝑩)(𝑪 + 𝑫)(𝑨 ̅ + 𝑩 + 𝑫)
(c) (𝑨𝑩 + 𝑨 ̅𝑩̅ )(𝑪𝑫̅ +𝑪 ̅𝑫)
(d) 𝑨 + 𝑪𝑫 + (𝑨 + 𝑫 ̅ + 𝑫)
̅ )(𝑪
Chapter -7 – Pages-2
15. Write the Boolean equations and draw the logic diagram of the circuit whose outputs
are defined by the following truth table:
16. Simplify the following Boolean functions, using Karnaugh maps:
(a) 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟐, 𝟑, 𝟔, 𝟕)
(b) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟒, 𝟔, 𝟕, 𝟏𝟓)
(c) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟑, 𝟕, 𝟏𝟏, 𝟏𝟑, 𝟏𝟒, 𝟏𝟔)
(d) 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟐, 𝟑, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓)
(e) 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓)
(f) 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟖, 𝟏𝟎, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒)
17. Simplify the following Boolean functions, using four-variable maps:
(a) 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟒, 𝟓, 𝟔, 𝟏𝟐, 𝟏𝟒, 𝟏𝟓)
(b) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟐, 𝟑, 𝟔, 𝟕, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒)
(c) 𝑭(𝒘, 𝒙, 𝒚, 𝒛) = ∑(𝟏, 𝟑, 𝟒, 𝟓, 𝟔, 𝟕, 𝟗, 𝟏𝟏, 𝟏𝟑, 𝟏𝟓)
(d) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟐, 𝟒, 𝟓, 𝟔, 𝟕, 𝟖, 𝟏𝟎, 𝟏𝟑, 𝟏𝟓)
18. Simplify the following Boolean expressions, using four-variable maps:
̅𝑩
(a) 𝑨 ̅𝑪̅𝑫 ̅ + 𝑨𝑪 ̅𝑫̅ +𝑩 ̅ 𝑪𝑫̅+ 𝑨 ̅ 𝑩𝑪𝑫 + 𝑩𝑪 ̅𝑫
̅𝒛 + 𝒘
(b) 𝒙 ̅ 𝒙𝒚̅ + 𝒘(𝒙̅𝒚 + 𝒙𝒚 ̅)
̅ ̅ ̅ ̅ ̅ ̅
(c) 𝑨 𝑩 𝑪 𝑫 + 𝑨𝑩𝑫 + 𝑨𝑩𝑪 + 𝑨𝑩𝑪𝑫 + 𝑨𝑩 ̅𝑪
̅𝑩
(d) 𝑨 ̅𝑪̅𝑫̅ + 𝑩𝑪 ̅𝑫 + 𝑨 ̅𝑫 + 𝑨
̅𝑪 ̅ 𝑩𝑪𝑫 + 𝑨𝑪𝑫 ̅
19. Simplify the following Boolean expressions, using four-variable maps:
(a) 𝒘 ̅𝒚 + 𝒘𝒙
̅ 𝒛 + 𝒙𝒛 + 𝒙 ̅𝒛
(b) 𝑨𝑫̅ +𝑩̅𝑪̅𝑫 + 𝑩𝑪𝑫 ̅ + 𝑩𝑪̅𝑫
̅𝑪 + 𝑩
(c) 𝑨𝑩 ̅𝑪̅𝑫̅ + 𝑩𝑪𝑫 + 𝑨𝑪𝑫 ̅ +𝑨̅𝑩 ̅𝑪 + 𝑨 ̅𝑫
̅ 𝑩𝑪
(d) 𝒘𝒙𝒚 + 𝒙𝒛 + 𝒘𝒙 ̅𝒛 + 𝒘̅𝒙
Chapter -7 – Pages-3
20. Find the minterms of the following Boolean expressions by first plotting each function
in a map:
(a) 𝒙𝒚 + 𝒚𝒛 + 𝒙𝒚 ̅𝒛
(b) 𝑪̅𝑫 + 𝑨𝑩𝑪 ̅ + 𝑨𝑩𝑫 ̅ +𝑨 ̅𝑩 ̅𝑫
(c) 𝒘𝒚𝒛 + 𝒘 ̅𝒙 ̅ + 𝒘𝒙𝒛̅
(d) 𝑨̅𝑩 + 𝑨 ̅ 𝑪𝑫 + 𝑩 ̅ 𝑪𝑫 + 𝑩𝑪 ̅𝑫 ̅
21. Find all the prime implicants for the following Boolean functions, anddetermine which
are essential:
(a) F(w, x, y, z) = ⅀(0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
(b) F (A, B, C, D) = ⅀ (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)
(c) F(A, B, C, D) = ⅀ (2, 3, 4, 5, 6, 7, 9, 11, 12, 13)
(d) F(w, x, y, z) = ⅀ (1, 3, 6, 7, 8, 9, 12, 13, 14, 15)
(e) F(A, B, C, D) = ⅀(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
(f) F(w, x, y, z) = ⅀(0, 1, 2, 5, 7, 8, 10, 15)
Chapter -7 – Pages-4