Logic Circuit Simplification Questions

• The Boolean expression is logically equivalent to what single gate?
• Which statement below best describes a Karnaugh map?
• The systematic reduction of logic circuits is accomplished by:
• Which of the examples below expresses the commutative law of multiplication?
• Which output expression might indicate a product-of-sums circuit construction?
• Which of the following expressions is in the sum-of-products (SOP) form?
• One of DeMorgan's theorems states that . Simply stated, this means that logically there is no difference between:
• Which of the examples below expresses the distributive law of Boolean algebra?
• The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as:
• Logically, the output of a NOR gate would have the same Boolean expression as a(n):
• The commutative law of addition and multiplication indicates that:
• The associative law of addition states that A + (B + C) = (A + B) + C.
• The expressions, , are equivalent.
• The application of DeMorgan's theorems to a Boolean expression with double and single inversions produces a resultant expression that contains only single inverter signs over single variables.
• According to the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.
• The sum-of-products form is a Boolean expression that describes the ANDing of two or more OR functions.
• Subtraction is commutative.
• is the algebraic expression for the duality theorem.
• The double-inversion rule states that if a variable is inverted twice, then the variable will be back to its original state.
• Boolean multiplication is symbolized by A + B.