Karnaugh Map (K-map) K-Map is a pictorial representation of the Boolean function. It is a systematic method of simplifying the Boolean expression. A K-Map is an arrangement of the adjacent cell , each cell representing the minterm or the maxterm of the SOP or the POS equations. The number of adjacent cells in a K-Map depends on the number of input variables in an equation. The number of cell equals 2N where N is the number of input variables. Let us see how the minterm or the maxterms of the SOP or POS equations are represented. Two variable K-Map Table in figure-1 on the left is a truth table for two input variables. The output is shown in column marked ‘F’.  m0, m1, m2,