Q. Each “1” entry in a K-map square represents: (Solved)
1. a high for each input truth table condition that produces a high output
2. a high output on the truth table for all low input combinations
3. a low output for all possible high input conditions
4. a don’t care condition for all possible input truth table combinations
- a. a high for each input truth table condition that produces a high output