Question

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

I have been asked this question in an interview for job.

The query is from K-Map Simplification topic in chapter Arithmetic Circuits of Digital Circuits

Answer 1

Right option is (a) A HIGH for each input truth table condition that produces a HIGH output

Easiest explanation: Each “1” entry in a K-map square represents a HIGH for each input truth table condition that produces a HIGH output. Thus, it represents a minterm.