Introduction To K-Map 

#snsinstitutions
#snsdesignthinkers
#designthinking
In many digital circuits and practical problems, we need to find expressions with minimum variables. We can minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra theorems.
K-map can take two forms:
Sum of product (SOP)
Product of Sum (POS)
According to the need of problem. K-map is a table-like representation, but it gives more information than the TABLE. We fill a grid of the K-map with 0’s and 1’s then solve it by making groups.