Electronics-Logic Circuit Simplification
Electronics-Logic Circuit Simplification
1. Which statement below best describes a Karnaugh map?
- It is simply a rearranged truth table.
- The Karnaugh map eliminates the need for using NAND and NOR gates.
- Variable complements can be eliminated by using Karnaugh maps.
- A Karnaugh map can be used to replace Boolean rules.
2. 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
3. The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as:
- a Karnaugh map
- DeMorgan's second theorem
- the commutative law of addition
- the associative law of multiplication
4. The systematic reduction of logic circuits is accomplished by:
- symbolic reduction
- TTL logic
- using Boolean algebra
- using a truth table
5. Logically, the output of a NOR gate would have the same Boolean expression as a(n):
- NAND gate immediately followed by an INVERTER
- OR gate immediately followed by an INVERTER
- AND gate immediately followed by an INVERTER
- NOR gate immediately followed by an INVERTER
6. The commutative law of addition and multiplication indicates that:
- the way we OR or AND two variables is unimportant because the result is the same
- we can group variables in an AND or in an OR any way we want
- an expression can be expanded by multiplying term by term just the same as in ordinary algebra
- the factoring of Boolean expressions requires the multiplication of product terms that contain like variables