The systematic reduction (simplification) of logic circuits is accomplished by: a. using a truth table b....

Transcribed Image Text:

The systematic reduction (simplification) of logic circuits is accomplished by: a. using a truth table b. using Boolean algebra Oc. TTL logic d. symbolic reduction QUESTION 5 Which of the examples below expresses the distributive law of Boolean algebra? a. (A+B) + C = A + (B+C) b. A(B+C) = AB - cABC)= AB) +C a.A - (B+C) = AB-AC AC The systematic reduction (simplification) of logic circuits is accomplished by: a. using a truth table b. using Boolean algebra Oc. TTL logic d. symbolic reduction QUESTION 5 Which of the examples below expresses the distributive law of Boolean algebra? a. (A+B) + C = A + (B+C) b. A(B+C) = AB - cABC)= AB) +C a.A - (B+C) = AB-AC AC