K-map is a table-like representation of a boolean expression. K-map is used to minimize the Boolean expression so that the circuit can be implemented using the least number of gates and become more efficient. K-map is a table-like representation but it gives more information than TRUTH TABLE.