Karnaugh Map (K-Map) : 2, 3 and 4 Variable K-Maps, MinTerm, MaxTerm, SOP, POS

Karnaugh Map (K-Map) simplifies boolean expression through a pictorial representation in which a table is formed based on the number of input variables. K-Map always gives the minimized expression, however, this expression may not be unique.

We can minimize Boolean expressions of 2, 3, 4 variables very easily using K-map without using any Boolean algebra theorems. K-map can take two forms Sum of Product (SOP) and Product of Sum (POS) according to the need of problem.

After watching this video you will be able to answer the following questions
1. What is Sum of Product (SOP) ?
2. What is Product of Sum (POS) ?
3. What is Minterm ?
4. What is Maxterm ?
5. Which K-Map to use for the given boolean function ?
6. How to minimize boolen expression based on 2, 3 or 4 input variable using K-Map ?
7. How to form groups in K-Map ?
8. How to find implicants in K-Map ? 9:55
9. How to find prime implicants in K-Map ?
10. How to find essential Prime implicants in K-Map ?