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 highoutput on the truth table for all low input combination s.
3. a lowoutput for all possible high input conditions.
4. a don\t carecondition for all possible input truth table combinati ons.
- a. a high for each input truth table condition that produces a high output.