21. The commutative law of addition and multiplication indicates that:
(a) we can group variables in an AND or in an OR any way we want
(b) an expression can be expanded by multiplying term by term just the same as in ordinary algebra
(c) the way we OR or AND two variables is unimportant because the result is the same
(d) the factoring of Boolean expressions requires the multiplication of product terms that contain like variables
22. Which of the examples below expresses the commutative law of multiplication?
(a) A + B = B + A
(b) AB = B + A
(c) AB = BA
(d) AB = A × B
23. Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?
(a) associative
(b) commutative
(c) Boolean
(d) distributive
24. Which of the examples below expresses the distributive law of Boolean algebra?
(a) (A + B) + C = A + (B + C)
(b) A(B + C) = AB + AC
(c) A + (B + C) = AB + AC
(d) A(BC) = (AB) + C
25. The systematic reduction of logic circuits is accomplished by:
(a) using Boolean algebra
(b) symbolic reduction
(c) TTL logic
(d) using a truth table
Related Posts
555555555529. When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be: (a) X = A + B (b) (c) X = (A)(B) (d)- 555555555592. Logically, the output of a NOR gate would have the same Boolean expression as a(n): (a) NAND gate immediately followed by an inverter (b) OR gate immediately followed by an inverter (c) AND gate immediately followed by an inverter (d) NOR gate immediately followed by an inverter
- 555555555566. The Boolean expression for a 3-input AND gate is ________. (a) X = AB (b) X = ABC (c) X = A + B + C (d) X = AB + C
- 555555555591. Write the Boolean expression for an inverter logic gate with input C and output Y. (a) Y = C (b) (c) (d)
- 555555555564. The Boolean expression for a 3-input OR gate is ________. (a) X = A + B (b) X = A + B + C (c) X = ABC (d) X = A + BC