Question

K-map is used for _______

(a) logic minimization

(b) expression maximization

(c) summing of parity bits

(d) logic gate creation

This question was posed to me in class test.

This is a very interesting question from Boolean Algebra in division Boolean Algebra and Modeling Computations of Discrete Mathematics

Answer 1

The correct option is (a) logic minimization

To explain I would say: K-map(Maurice Karnaugh of Bell labs in 1953) is defined as a diagrammatic method for logic minimization and it is a pictorial view of truth table which shows the relationship between inputs and output. It is more efficient than Boolean algebra. K-map is a diagram made up of squares in which each square represents a minterm or maxterm of the logic function.