Professional Documents
Culture Documents
ASSIGNMENT 2 PROBLEMS
2. Implement the Boolean function F (A, B, C) = Σ(0, 1, 3, 5) using a minimal number of NAND
gates.
Y = A ⊕ B = AB + AB
4. Convert the following Boolean expression from sum-of-products form to product-of-sums form:
5. Find the canonical sum-of-products and product-of-sums forms for the Boolean function:
F (A, B, C) = Σ(0, 1, 3, 5)
1
6. Optimize the Boolean expression for a 4-input majority function:
(A + BC)(AB + C)(A + B + C) = A + C
8.
9. Implement the Boolean function F (A, B, C) = Σ(0, 1, 3, 5) using a minimal number of NAND
gates.
Y = A ⊕ B = AB + AB
11. Convert the following Boolean expression from sum-of-products form to product-of-sums form:
12. Find the canonical sum-of-products and product-of-sums forms for the Boolean function:
F (A, B, C) = Σ(0, 1, 3, 5)
13. Simplify the following expression involving AND, OR, and NOT gates:
Y = (A + B) · C + AB
2
14. Optimize the Boolean expression for a 4-input majority function:
(A + BC)(AB + C)(A + B + C) = A + C
17. Implement the Boolean function F (A, B, C) = Σ(0, 2, 5, 7) using a minimal number of NOR
gates.