Electronics  Logic Circuit Simplification
Exercise :: Logic Circuit Simplification  Filling the Blanks
1. 
Each "1" entry in a Kmap 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:

2. 
One reason for using the sumofproducts form is that it can be implemented using all ______ gates without much alteration. 
Answer: Option B
Explanation:

3. 
When grouping cells within a Kmap, the cells must be combined in groups of ________. 
Answer: Option B
Explanation:

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:

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 sumofproducts expression  D. 
give an overall picture of how the signals flow through the logic circuit 
Answer: Option C
Explanation:
