CDA 103
Tutorial Sheet-5
Group 1
1. Simplify the following Boolean expression using Boolean algebra:
F (A, B, C) = A · B + A · B · C + A · B · C
2. Minimize the following Boolean expression using Boolean identities
F (A, B, C) = A · B + BC + B · C + AB · C
3. Write the Boolean function for the sum of maxterms F (A, B, C) for the truth table where the
function is 0 at minterms 1, 4, 6, and 7.
4. Write the Boolean expression for the product of minterms for the function F (A, B, C) which is 1
for minterms 0, 2, 5.
5. Simplify the following function using a 3-variable K-map:
X
F (A, B, C) = m(0, 1, 2, 5, 7)
6. Simplify the Boolean expression using a 4-variable K-map:
X
F (A, B, C, D) = m(1, 3, 7, 11, 15)
P
7. Use a K-map to simplify F (A, B, C) = m(0, 1, 4, 5).
8. Minimize the following Boolean expression using K-map
F (A, B, C) = ABC + ABC + ABC + ABC
9.
Minimize the expression = (A + B + C)(A + B + C)(A + B + C)
10. Write simplified expression for the given K-map
1
Tutorial Sheet-5
Group 1
1. Simplify the following Boolean expression using Boolean algebra:
F (A, B, C) = A · B + A · B · C + A · B · C
2. Minimize the following Boolean expression using Boolean identities
F (A, B, C) = A · B + BC + B · C + AB · C
3. Write the Boolean function for the sum of maxterms F (A, B, C) for the truth table where the
function is 0 at minterms 1, 4, 6, and 7.
4. Write the Boolean expression for the product of minterms for the function F (A, B, C) which is 1
for minterms 0, 2, 5.
5. Simplify the following function using a 3-variable K-map:
X
F (A, B, C) = m(0, 1, 2, 5, 7)
6. Simplify the Boolean expression using a 4-variable K-map:
X
F (A, B, C, D) = m(1, 3, 7, 11, 15)
P
7. Use a K-map to simplify F (A, B, C) = m(0, 1, 4, 5).
8. Minimize the following Boolean expression using K-map
F (A, B, C) = ABC + ABC + ABC + ABC
9.
Minimize the expression = (A + B + C)(A + B + C)(A + B + C)
10. Write simplified expression for the given K-map
1
