Which of the examples below expresses the distributive law of Boolean algebra? A

CuriousTab

CuriousTab

Home Aptitude

Discussion

Home ‣ Electronics ‣ Logic Circuit Simplification Comments

Question
Which of the examples below expresses the distributive law of Boolean algebra?
Options
A. A ? (B ? C) = (A ? B) + C
B. A + (B + C) = (A ? B) + (A ? C)
C. A ? (B + C) = (A ? B) + (A ? C)
D. (A + B) + C = A + (B + C)

Correct Answer

A ? (B + C) = (A ? B) + (A ? C)

Logic Circuit Simplification problems

Search Results

1. One of DeMorgan's theorems states that . Simply stated, this means that logically there is no difference between:
Options
A. a NAND gate and an AND gate with a bubbled output
B. a NOR gate and an AND gate with a bubbled output
C. a NOR gate and a NAND gate with a bubbled output
D. a NAND gate and an OR gate with a bubbled output

6. The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as:
Options
A. a Karnaugh map
B. DeMorgan's second theorem
C. the commutative law of addition
D. the associative law of multiplication

7. Logically, the output of a NOR gate would have the same Boolean expression as a(n):
Options
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

8. The commutative law of addition and multiplication indicates that:
Options
A. the way we OR or AND two variables is unimportant because the result is the same
B. we can group variables in an AND or in an OR any way we want
C. an expression can be expanded by multiplying term by term just the same as in ordinary algebra
D. the factoring of Boolean expressions requires the multiplication of product terms that contain like variables

Comments

More in Electronics: