Lesson Plan

• Describe the purpose of Karnaugh maps for simplifying Boolean functions.
• Explain how to construct K‑maps for 2‑4 variables using Gray‑code ordering.
• Identify optimal groups of 1’s (or 0’s) including don’t‑care cells.
• Derive minimal SOP or POS expressions from a completed K‑map.
• Detect and correct common pitfalls such as incorrect adjacency or missed wrap‑around.

• Projector and screen
• Whiteboard and markers
• Printed K‑map worksheets (2‑, 3‑, and 4‑variable grids)
• Sample truth tables for practice functions
• Laptops with logic‑circuit software (e.g., Logisim)
• Answer key for guided examples

Begin with a quick puzzle: “Can you reduce this Boolean expression without a map?” Students recall Boolean algebra rules, then discover the limits of algebraic simplification. Explain that today’s success criteria are to construct a K‑map, form the largest possible groups, and produce a minimal expression.

1. Do‑now (5') – short quiz on Boolean algebra basics and minterm notation.
2. Mini‑lecture (10') – introduce K‑map layout, Gray‑code ordering, adjacency, and don’t‑care handling.
3. Guided practice (15') – students construct a 3‑variable K‑map for a given function and identify groups with teacher support.
4. Collaborative activity (15') – in pairs, fill a 4‑variable K‑map from the provided truth table, highlight groups, and write the minimal SOP.
5. Check for understanding (5') – exit‑ticket question: “What is the biggest mistake that can invalidate a K‑map simplification?”
6. Summary & homework (5') – recap key steps, assign practice questions from the source notes.

Review the five‑step process of K‑map simplification and emphasise how proper grouping reduces gate count. Collect exit tickets to gauge understanding, and remind students to complete the three practice K‑map problems for homework, bringing any difficulties to the next class.