Multiple Choice
Each "1" entry in a K-map square represents:
A) a high for each input truth table condition that produces a high output
B) a high output on the truth table for all low input combinations
C) a low output for all possible high input conditions
D) a don't care condition for all possible input truth table combinations
Correct Answer:

Verified
Correct Answer:
Verified
Q8: Each "0" entry in a K-map square
Q9: Which of the examples below expresses the
Q10: The systematic reduction of logic circuits is
Q11: One example of the use of an
Q12: Looping on a K-map always results in
Q14: A TTL gate may operate inadvertently as
Q15: When is a flip-flop said to be
Q16: The difference between a flip-flop & latch
Q17: Which statement below best describes a Karnaugh
Q18: What is one disadvantage of an S-R