Engineering Algebra 2: [ASSIGNMENT 3]

December 5, 2023

ASSIGNMENT 3 PROBLEMS

1. Given the Boolean function F (A, B, C) = Σ(0, 1, 3, 5, 6, 7), use a 3-variable K-map to
simplify the expression.

2. Simplify the Boolean function F (A, B, C) = Σ(1, 2, 4, 7) using a 3-variable K-map.

3. For the Boolean function F (A, B, C) = Σ(0, 2, 3, 5, 6), apply the 3-variable K-map
technique to find the simplified expression.

4. Given F (A, B, C) = Σ(1, 3, 4, 5, 6, 7), use a 3-variable K-map to obtain the minimized
Boolean expression.

5. Simplify the Boolean function F (A, B, C) = Σ(0, 1, 3, 4, 6, 7) using a 3-variable Kar-

naugh Map.

6. Given the Boolean function F (A, B, C, D) = Σ(1, 3, 5, 7, 9, 11, 13, 15), use a 4-variable
K-map to simplify the expression.

7. Simplify the Boolean function F (A, B, C, D) = Σ(0, 2, 5, 8, 10, 14, 15) using a 4-variable
K-map.

8. For the Boolean function F (A, B, C, D) = Σ(1, 2, 4, 5, 7, 11, 12, 15), apply the 4-variable
K-map technique to find the simplified expression.

1
 9. Given F (A, B, C, D) = Σ(0, 1, 2, 5, 6, 8, 10, 14), use a 4-variable K-map to obtain the
minimized Boolean expression.

10. Simplify the Boolean function F (A, B, C, D) = Σ(2, 5, 8, 10, 12, 13, 14, 15) using a 4-
variable Karnaugh Map.

11. Given the Boolean function F (A, B, C, D, E) = Σ(3, 5, 7, 11, 14, 18, 20, 21, 22, 23, 27, 30, 31),
use a 5-variable K-map to simplify the expression.

12. Simplify the Boolean function F (A, B, C, D, E) = Σ(0, 1, 3, 6, 9, 11, 15, 17, 18, 21, 24, 25, 27, 30, 31)
using a 5-variable K-map.

13. For the Boolean function F (A, B, C, D, E) = Σ(1, 3, 5, 9, 12, 13, 16, 17, 21, 23, 27, 28, 29, 31),
apply the 5-variable K-map technique to find the simplified expression.

14. Given F (A, B, C, D, E) = Σ(3, 5, 7, 11, 13, 15, 19, 21, 23, 27, 29, 31), use a 5-variable K-
map to obtain the minimized Boolean expression.

15. Simplify the Boolean function F (A, B, C, D, E) = Σ(0, 2, 5, 8, 10, 13, 16, 18, 20, 23, 26, 29, 31)
using a 5-variable Karnaugh Map.