IndiaBIX

Electronics - Logic Circuit Simplification

Exercise : Logic Circuit Simplification - General Questions
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.
Answer: Option
Explanation:
No answer description is available. Let's discuss.
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
Answer: Option
Explanation:
No answer description is available. Let's discuss.
3.
The Boolean expression mcq19_1001_1.gif is logically equivalent to what single gate?
NAND
NOR
AND
OR
Answer: Option
Explanation:
No answer description is available. Let's discuss.
4.
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
Answer: Option
Explanation:
No answer description is available. Let's discuss.
5.
The systematic reduction of logic circuits is accomplished by:
symbolic reduction
TTL logic
using Boolean algebra
using a truth table
Answer: Option
Explanation:
No answer description is available. Let's discuss.
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers