On this page
Karnaugh maps turn a page of Boolean algebra into a picture you can simplify in a minute, which is why the ISC syllabus names them. They also reward care: one cell in the wrong place gives a wrong answer that looks right. This post explains the layout, the grouping rules, and two fully worked four-variable examples you can check yourself.
Where are Karnaugh maps in the ISC syllabus?
The ISC 2027 Computer Science syllabus puts Boolean algebra in Class XII, Paper I (Theory, 70 marks). It lists basic theorems, De Morgan's theorem, "reducing Boolean expressions to sum of products and product of sums forms" and "Karnaugh maps (up to four variables)". The Class XII practical guidance adds SOP and POS representation, minterms and maxterms, canonical and cardinal forms, and "reduction using Karnaugh maps and Boolean algebra".
The method comes from Maurice Karnaugh's paper The map method for synthesis of combinational logic circuits, published in the Transactions of the AIEE in November 1953.
How is a Karnaugh map laid out?
A four-variable map has 16 cells, one per row of the truth table. Rows are labelled by AB and columns by CD, in the order 00, 01, 11, 10. This order, called Gray code, changes one bit at a time, so any two side-by-side cells differ in one variable. The order wraps: the 10 column is next to the 00 column, and the top row is next to the bottom row.
With A as the most significant bit, the minterm numbers sit like this:
Row AB = 00: cells 0, 1, 3, 2
Row AB = 01: cells 4, 5, 7, 6
Row AB = 11: cells 12, 13, 15, 14
Row AB = 10: cells 8, 9, 11, 10
Notice that the third and fourth entries in each row, and the third and fourth rows, are swapped from counting order. That swap is where most errors start.
What are the grouping rules?
Group only adjacent cells, including across the wrapped edges.
Each group must have 1, 2, 4, 8 or 16 cells, in a rectangle.
Make each group as large as possible, and use as few groups as possible.
Every 1 (for SOP) must be in at least one group; groups may overlap.
In each group, keep only the variables that do not change.
Worked example 1: an SOP reduction
Simplify F(A, B, C, D) = Σ(0, 2, 5, 7, 8, 10, 13, 15).
Place 1s in cells 0, 2, 8, 10: these are the four corners of the map.
The corners form one group of four, because the edges wrap. In it, B = 0 and D = 0 throughout, while A and C change. The term is B′D′.
Place 1s in cells 5, 7, 13, 15: a square in the middle of rows 01 and 11, columns 01 and 11. Here B = 1 and D = 1 throughout. The term is BD.
F = B′D′ + BD.
Check one cell: minterm 7 is A=0, B=1, C=1, D=1. BD = 1, so F = 1, as it should be. Checking minterm 1 (A=0, B=0, C=0, D=1): B′D′ = 0 and BD = 0, so F = 0, correct because 1 is not in the list. The answer is B XNOR D, which you would struggle to spot by algebra alone.
Worked example 2: an SOP with an 8-cell group
Simplify F(A, B, C, D) = Σ(0, 1, 2, 3, 4, 5, 8, 9, 10, 11).
Rows AB = 00 and AB = 10 are full, and they are adjacent because the map wraps top to bottom. That gives a group of eight where B = 0: the term B′.
Cells 4 and 5 remain. Pair them with cells 0 and 1 to make a group of four: A = 0 and C = 0 throughout, giving A′C′.
F = B′ + A′C′.
How do you get a POS answer?
For product of sums, group the 0s instead. Each group gives a sum term: a variable that stays 0 appears plain, and one that stays 1 appears complemented. For a three-variable example, F(A, B, C) = Π(0, 1, 2, 4) has 0s at those cells, and grouping them in pairs gives F = (A + B)(A + C)(B + C).
Common mistakes and how to avoid them
Labelling columns 00, 01, 10, 11. Use 00, 01, 11, 10.
Missing wrap-around groups, especially the four corners.
Groups of three or six. Only powers of two are allowed.
Stopping at pairs when a quad or octet is available, which leaves an expression that is correct but not fully simplified.
Mixing SOP and POS reading rules when you switch from 1s to 0s.
A practice routine for K-maps
Draw a blank four-variable map with minterm numbers until you can do it from memory. Then solve two SOP and one POS problem a day, and check each answer by substituting two minterms and one non-minterm, as in example 1. Our guide to ISC computer science and Java covers the rest of the paper, and Boolean logic for CBSE Class 11 revises the gates and laws underneath.
When a reduction will not simplify, the Fermi Problem Library has worked problems with a step-by-step solver that explains the reasoning rather than printing an answer.
Start with example 1: draw the map, circle the corners, and see the answer appear.
