Multiple Choice
Each "0" 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
Q3: How many types of flip-flops are?<br>A)2<br>B)3<br>C)4<br>D)5
Q4: The S-R flip flop consist of <br>A)4
Q5: When both inputs of a J-K flip-flop
Q6: One example of the use of an
Q7: What is the hold condition of a
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
Q13: Each "1" entry in a K-map square