31. What is the primary motivation for using Boolean algebra to simplify logic expressions?
(a) It may make it easier to understand the overall function of the circuit.
(b) It may reduce the number of gates.
(c) It may reduce the number of inputs required.
(d) all of the above
32. The Boolean expression is logically equivalent to what single gate?
(a) NAND
(b) NOR
(c) AND
(d) OR
33. An OR gate with schematic “bubbles” on its inputs performs the same functions as a(n)________ gate.
(a) NOR
(b) OR
(c) NOT
(d) NAND
34. Determine the values of A, B, C, and D that make the product term equal to 1.
(a) A = 0, B = 1, C = 0, D = 1
(b) A = 0, B = 0, C = 0, D = 1
(c) A = 1, B = 1, C = 1, D = 1
(d) A = 0, B = 0, C = 1, D = 0
35. Applying DeMorgan’s theorem to the expression , we get ________.
(a)
(b)
(c)
(d)
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