Six original Cambridge-style questions on drawing and using Karnaugh maps for three and four inputs, with mark-scheme style solutions.
State two benefits of using a Karnaugh map to simplify a logic expression.
A logic circuit has inputs A, B and C. The output X is 1 for the rows 000, 010, 100, 101 and 110 only. Draw the K-map and find the simplest expression for X.
| A \ BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 | 1 |
Find the simplest sum-of-products expression for this K-map.
| AB \ CD | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 00 | 1 | 1 | 1 | 1 |
| 01 | 0 | 1 | 0 | 0 |
| 11 | 0 | 1 | 0 | 0 |
| 10 | 1 | 1 | 1 | 1 |
Find the simplest sum-of-products expression for this K-map.
| AB \ CD | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 00 | 1 | 0 | 0 | 1 |
| 01 | 1 | 0 | 1 | 1 |
| 11 | 1 | 0 | 1 | 1 |
| 10 | 1 | 0 | 0 | 1 |
A sprinkler X switches on when the water tank is not empty (B = 1) and at least one of these is true: the soil is dry (A = 1), the temperature is high (C = 1) or the timer is on (D = 1). Use a Karnaugh map to find the simplest sum-of-products expression for X.
| AB \ CD | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 00 | 0 | 0 | 0 | 0 |
| 01 | 0 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 1 |
| 10 | 0 | 0 | 0 | 0 |
A student draws a three-input K-map with columns labelled 00, 01, 10, 11 and circles a group of three 1s. Explain the two errors and why each matters.
Mark this once you have attempted all six and checked your working. It records a Practiced badge on the topic and adds a one-time bonus. Revealing the solutions alone does not count.