Ch 8 · Karnaugh Maps & Flip-Flops (A Level) · Theory

Topic 8 of 10 in Boolean Logic & Logic Gates — How Machines Decide — 2 lessons.

Karnaugh Maps

A Karnaugh map (K-map) is a grid that rearranges a truth table so that simplification becomes visual: you circle groups of adjacent 1s (in powers of two) and read off a simplified expression. Adjacent cells differ by only one variable, which is why grouping them cancels that variable out.

Flip-Flops: Storing a Bit

Everything so far has been combinational — output depends only on the current inputs. A flip-flop is sequential: it *remembers* a bit even after the inputs change. Flip-flops (like the SR and JK types) are how registers and cache physically store data.

All topics in Theory Boolean-logic

1. Why Logic Gates
2. NOT, AND, OR
3. NAND, NOR, XOR
4. Truth Tables
5. From Problem to Circuit
6. Logic Expressions
7. Boolean Algebra (A Level)
8. Karnaugh Maps & Flip-Flops (A Level)
9. Gates That Do Arithmetic
10. Check Your Understanding