Home » LOGIC CIRCUIT SIMPLIFICATION Online QUIZ » 40 TOP LOGIC CIRCUIT SIMPLIFICATION Online Test – Questions and Answers 40 TOP LOGIC CIRCUIT SIMPLIFICATION Online Test – Questions and Answers Posted on August 19, 2018April 28, 2017 by engineerLeave a comment 1. Which of the examples below expresses the commutative law of multiplication? A • B = B • A A • B = B + A A • (B • C) = (A • B) • C A + B = B + A 2. Logically, the output of a NOR gate would have the same Boolean expression as a(n): NOR gate immediately followed by an INVERTER NAND gate immediately followed by an INVERTER OR gate immediately followed by an INVERTER AND gate immediately followed by an INVERTER 3. Which of the examples below expresses the distributive law of Boolean algebra? A + (B + C) = (A • B) + (A • C) A • (B + C) = (A • B) + (A • C) A • (B • C) = (A • B) + C (A + B) + C = A + (B + C) 4. Which statement below best describes a Karnaugh map? Variable complements can be eliminated by using Karnaugh maps It is simply a rearranged truth table A Karnaugh map can be used to replace Boolean rules The Karnaugh map eliminates the need for using NAND and NOR gates 5. The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as: the associative law of multiplication a Karnaugh map DeMorgan’s second theorem the commutative law of addition 6. The commutative law of addition and multiplication indicates that: the factoring of Boolean expressions requires the multiplication of product terms that contain like variables an expression can be expanded by multiplying term by term just the same as in ordinary algebra we can group variables in an AND or in an OR any way we want the way we OR or AND two variables is unimportant because the result is the same 7. The systematic reduction of logic circuits is accomplished by: using Boolean algebra symbolic reduction TTL logic using a truth table Loading … Question 1 of 7