Electronics - Logic Circuit Simplification

Exercise :: Logic Circuit Simplification - Filling the Blanks

1. 

Each "1" entry in a K-map square represents ______________.

A. a HIGH output on the truth table for all input combinations
B. a LOW output for all possible HIGH input conditions
C. a DON'T CARE condition for all possible input truth table combinations
D. a HIGH for each input truth table condition that produces a HIGH output

Answer: Option D

Explanation:

No answer description available for this question. Let us discuss.

2. 

One reason for using the sum-of-products form is that it can be implemented using all ______ gates without much alteration.

A. AND
B. NAND
C. OR
D. NOR

Answer: Option B

Explanation:

No answer description available for this question. Let us discuss.

3. 

When grouping cells within a K-map, the cells must be combined in groups of ________.

A. 2s
B. 1, 2, 4, 8, etc.
C. 4s
D. 3s

Answer: Option B

Explanation:

No answer description available for this question. Let us discuss.

4. 

The application of Boolean algebra to the solution of digital logic circuits was first explored by ________ of ________.

A. Claude Shannon, MIT
B. George Boole, MIT
C. George Boole, Stanford
D. Claude Shannon, IBM

Answer: Option A

Explanation:

No answer description available for this question. Let us discuss.

5. 

A Karnaugh map will ____________________.

A. eliminate the need for tedious Boolean expressions
B. allow any circuit to be implemented with just AND and OR gates
C. produce the simplest sum-of-products expression
D. give an overall picture of how the signals flow through the logic circuit

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.