Electronics - Logic Circuit Simplification

Exercise : Logic Circuit Simplification - Filling the Blanks
1.
Each "1" entry in a K-map square represents ______________.
a HIGH output on the truth table for all input combinations
a LOW output for all possible HIGH input conditions
a DON'T CARE condition for all possible input truth table combinations
a HIGH for each input truth table condition that produces a HIGH output
Answer: Option
Explanation:
No answer description is available. Let's discuss.

2.
One reason for using the sum-of-products form is that it can be implemented using all ______ gates without much alteration.
AND
NAND
OR
NOR
Answer: Option
Explanation:
No answer description is available. Let's discuss.

3.
When grouping cells within a K-map, the cells must be combined in groups of ________.
2s
1, 2, 4, 8, etc.
4s
3s
Answer: Option
Explanation:
No answer description is available. Let's discuss.

4.
The application of Boolean algebra to the solution of digital logic circuits was first explored by ________ of ________.
Claude Shannon, MIT
George Boole, MIT
George Boole, Stanford
Claude Shannon, IBM
Answer: Option
Explanation:
No answer description is available. Let's discuss.

5.
A Karnaugh map will ____________________.
eliminate the need for tedious Boolean expressions
allow any circuit to be implemented with just AND and OR gates
produce the simplest sum-of-products expression
give an overall picture of how the signals flow through the logic circuit
Answer: Option
Explanation:
No answer description is available. Let's discuss.