Question

1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number of literals:

(a) A’C’ + A’BC + B’C

(b) (A + B + C)’(ABC)’

(c) ABC’ + AC

(d) A’B’D + A’C’D + BD

(e) (A’ + B)’(A’ + C’)’(AB’C)’
(f) (AE + A’B’)(C’D’ + CD) + (AC)’

2. Obtain the truth table of the function F = (AB + C)(B + AC), express the function F in sum-of-minterms and product-of-maxterms forms, and express the function F’ in sum-of-minterms and product-of-maxterms forms.

3. Use Boolean algebra to convert the following expressions into sum-of-products and product-of-sums forms:

(a) (AB + C)(B + C’D)’
(b) X’ + X(X + Y’)(Y + Z’)’
(c) (A + BC’ + CD)(B’ + EF)’

Answer 1