FL
🎯 Topic 10 Boolean logic · 10.11

10.11 Purpose Lab

Real-world problems become gates. Read the scenario. Extract the binary meaning. Produce expression, circuit, and truth table. The syllabus finally asks a real question.

⚠️ Labs A and B are strong prerequisites. Lab C assumes fluency in every gate + expression↔circuit↔truth-table conversion. If either is not solid, brush up on Lab A or Lab B — but you can carry on here. Your call.
🧪 Exam Mode ON — recall from memory, then reveal
§1 · Topic Overview

Where Lab C sits

Labs A and B taught you the tools. Lab C is where you use them on real questions. A Cambridge Paper 2 problem-statement question gives you:

  • A scenario — described in natural language (a crane, a security alarm, a factory sensor, an SSD write-enable circuit)
  • A binary mapping table — three columns: Input · Binary value · Description. Tells you what physical condition each 0 and 1 means.
  • A list of alarm-condition lines — the criteria that must all be true for the output to fire

Your job: produce an expression, a circuit, and a truth table. All three must agree with each other and with the scenario. That's what the multi-modal marker in Problem Detective drills.

🎯 The Purpose metaphor

"The composition solves a real problem." Gates were the atoms (Lab A). Composition wired them into functions (Lab B). Purpose applies those functions to the world.

§2 · Learning Objectives

By the end of Lab C you will be able to:

  • Read a real-world problem statement and extract the binary meaning of each condition
  • Parse the input mapping table (Input / Binary value / Description) Cambridge always supplies
  • Handle "opposite" mappings — conditions where the binary value maps to NOT the natural reading (requires a NOT gate)
  • Write the full logic expression line-by-line from the problem statement
  • Draw the corresponding logic circuit
  • Complete the truth table with intermediate-output columns
  • Cross-check that expression, circuit, and truth table all agree (multi-modal consistency — the exam skill)
§3 · Key Terminology

Six new terms (inherits all Lab A + B terminology)

Problem statement — a logic problem described in natural language, giving criteria for the logic within that description. (Textbook §10.11.)
Binary mapping table — the Input / Binary value / Description table Cambridge provides for every problem-statement question. It defines what physical condition each variable's 0 and 1 correspond to.
Sensor input — an input variable whose value comes from a physical sensor: moisture, temperature, pressure, motion, sound, light.
Condition threshold — the physical value at which a sensor's binary output flips. Always read from the mapping table — never assume.
Alarm output — the single output of a problem-statement circuit. Typically X, W, M, or A. Represents the real-world action: alarm sounds, window opens, safe opens, crane moves.
Working space — the truth-table columns for intermediate outputs. Cambridge always provides these on problem-statement questions. Use them.
§4 · Core Theory · the 3-step method

§4.1 · Step 1 — Read the mapping table first

Before you read the scenario carefully, read the mapping table. It tells you what each variable's 0 and 1 mean. Only then read the alarm-condition lines.

Why first? Because the scenario is written in natural language, and natural language rarely lines up with the binary value. Reading the mapping first primes you to catch "opposite" cases (like "the temperature is 50°C or above" mapping to T = 0, needing NOT T in the expression).

§4.2 · Step 2 — Extract each alarm-condition line as a partial expression

Cambridge scenarios list criteria explicitly: "the alarm sounds if condition-1 OR condition-2 AND condition-3…". Take each phrase, look up its variable in the mapping table, and write the partial expression:

  • Natural: "the operator is present" · Mapping: A = 1 when operator present · Partial: A
  • Natural: "the ignition key is not present" · Mapping: B = 1 when key not present · Partial: B (same word — no NOT needed)
  • Natural: "the operator code is correct" · Mapping: C = 1 when code NOT correct · Partial: NOT C (opposite — invert)

Read the mapping every time. The scenario writer chose which direction to map; you don't get to guess.

§4.3 · Step 3 — Combine partials with AND/OR per the scenario's connective words

Cambridge scenarios use the words AND, OR, and occasionally only if, either, both. Translate:

  • "and" / "both" · AND
  • "or" / "either" · OR
  • "only if" · AND (the whole right-hand side must be true)
  • "unless" · AND NOT (be careful — this is a Trap 4-adjacent trap)

Bracket generously. Cambridge marks against wrong grouping.

§4.4 · Cross-check — the multi-modal consistency habit

Once you've written the expression, generate the truth table and check the circuit. If any two of the three disagree, one of them is wrong — usually the one with the most complex structure. Trace back to the alarm-condition line and re-read the mapping.

Problem Detective's Mode 4 (Full Challenge) drills this: it shows the 3×3 consistency matrix between your expression, circuit, and truth table. You won't have this tool in the exam — the point is to internalise the cross-check as a habit.

§5 · Worked Examples · soap factory + greenhouse

The two textbook problem statements, worked step by step

§6 · Common Misconceptions · 10 traps
§7 · Cambridge Exam Focus

Mark-scheme language — the problem-statement phrases

"The following table describes the inputs" — Cambridge intro to every mapping table
"X = 1 represents [the action]" — Cambridge's output-convention line · always read it
"Draw a logic circuit to represent the following statement" — the circuit sub-part stem
"Complete the truth table for the given problem statement" — the truth-table sub-part stem
"Write a logic expression for the following problem" — the expression sub-part stem
"Working space" — Cambridge's intermediate-column heading · always provided on problem-statement TT questions
"Most candidates gave a partially correct logic expression" — 2025 P22 examiner report · the "partial correctness" mark scheme is what Trap 3 targets
§8 · Quick Knowledge Check

0 / 6 revealed

Q1 · What is a problem statement?
A logic problem described in natural language, with criteria for its logic in that description. (Textbook §10.11.)
Q2 · What three columns does the binary mapping table have?
Input · Binary value · Description. Cambridge convention on every problem-statement question 2024 onwards.
Q3 · If the mapping says "temperature ≥ 50°C → T = 0" and the scenario says "the temperature is 50°C or above", do you use T or NOT T?
NOT T. The mapping puts the "hot" condition on the 0 side, so you need to invert to get 1 when hot. Read the mapping every time.
Q4 · A 3-input problem statement has how many rows in its truth table?
8 rows. Same rule as Lab B — 2^n rows for n inputs.
Q5 · Which representation should you produce first — expression, circuit, or truth table?
Expression. Line-by-line from the problem statement using the 3-step method. Then derive the circuit and truth table from the expression to keep all three consistent.
Q6 · If your expression, circuit, and truth table don't all agree, what does that tell you?
At least one is wrong. Usually the most complex representation. Trace back to the alarm-condition line and re-read the mapping. Cambridge marks each representation separately — internal consistency doesn't earn marks if all three are wrong the same way.
§9 · Topic 10 complete

🏆 You've completed the composition arc.

Signal (Lab A) taught you the gates. Circuit (Lab B) taught you to compose them. Purpose (this lab) taught you to apply that composition to real problems.

Next up: Topic 11 or an exam-focused revision cycle across all three labs. The interactive-heavy work of Topic 10 is done — you own the syllabus material.

📊 Where you are

0Practice attempts
0Exam questions
0Modes mastered

🎯 Weakest modes

🔥 Revise next

🎯 The Purpose arc

This is the third and final lab of Topic 10. Signal → Circuit → Purpose. The syllabus finally asks a real question, and you can answer it in all three forms.

The composition solves a real problem.

🎓 Reading a problem statement

Learn slows down what Book Notes covered. Try the 3-step method on a scenario preview, then head to Activities for the full Problem Detective.

The 3-step method — worked on the crane scenario (2025 P22 Q8)

Scenario: A crane is a machine used to lift heavy loads. The crane will only move if the operator is present and either the ignition key is present or the operator code is correct.
InputBinary valueDescription
A0operator not present
1operator present
B0ignition key present
1ignition key not present
C0operator code correct
1operator code not correct
X = 1 represents the crane moving.

Step 1 · Read the mapping table. Notice B and C are opposite to the natural reading — B = 1 means the key is not present, C = 1 means the code is not correct.

Step 2 · Extract each condition.

  • "operator is present" → mapping: A = 1 when operator present → partial: A
  • "ignition key is present" → mapping: B = 0 when key present → partial: NOT B
  • "operator code is correct" → mapping: C = 0 when code correct → partial: NOT C

Step 3 · Combine with the scenario's connectives. "and either X or Y" → AND (X OR Y). Full expression:

X = A AND (NOT B OR NOT C)

Note: the Cambridge mark scheme accepts multiple equivalent forms. The parser will accept any behaviourally-equivalent expression — commutative rearrangements and De Morgan-legal transforms all pass.

Contrast box · natural-reading vs mapping-value

🔍 The "opposite mapping" trap (Traps 1 + 2 target)

Cambridge deliberately writes some mappings opposite to the natural reading. Students who skip the mapping table lose easy marks.

Natural reading (WRONG)

"ignition key is present" → looks like B = 1

Expression: A AND (B OR C)

❌ Loses marks — didn't read the mapping

Mapping-value (RIGHT)

Mapping: B = 0 when key present → invert

Expression: A AND (NOT B OR NOT C)

✅ Full marks — mapping table respected

Habit: read the mapping table before the scenario. Every time. Cambridge writes opposite mappings on purpose.

Ready for Problem Detective?

The Activities tab has 5 modes: Statement → Expression · Statement → Truth Table · Statement → Circuit · Full Challenge (Guided · sequential) · Full Challenge (Free · parallel). Modes 4b (Free) unlocks after you complete 3 different scenarios in 4a (Guided).

🎯 Cambridge exam anchors

  • 10.3.b — Circuit from problem statement
  • 10.4.a — Expression from problem statement
  • 10.5.a — Combined multi-representation
  • 10.2.b (reinforcement)
  • 10.4.d (reinforcement)

2023+ Paper 2 questions: crane (2025 P22 Q8), security (2025 P23 Q7), safe (2024 P22 Q8), window (2024 P23 Q8).

🎮 Problem Detective

Five modes. Each teaches one facet of the composition-solves-a-real-problem skill. The multi-modal marker checks your expression, circuit, and truth table for consistency with each other and with the reference — mirroring how Cambridge marks each representation separately.

Progressive disclosure: Mode 4b (Full Challenge · Free) unlocks after you complete 3 different scenarios in Mode 4a (Full Challenge · Guided).

⌨️ Keyboard: Tab through mode buttons · Arrow keys within mode selector · Enter to activate · Tab into textarea / TT cells · Arrow keys navigate cells · 0/1 to fill · Space on gate palette to pick up gates.

60-second Sprint

Mixed prompts from Mode 1 (expression) and Mode 2 (truth-table row prediction). Mode 4b excluded — too multi-panel for a 60s timer. Weak scenarios surface 2× more often.

60Seconds left
0Correct
0Streak

📇 Scenario deck

12 scenarios · 4 from real Paper 2, 2 from textbook, 6 synthetic (following the Paper 2 pattern)

🎯 Mode coverage

💡 Mode guide

Mode 1 · Write the expression only. Fast reps.

Mode 2 · Fill the truth table only. Cell-by-cell.

Mode 3 · Write an expression that the circuit renderer will draw for you (so you see the circuit form of your answer).

Mode 4a · Sequential 3-step Full Challenge · Step 2 locked until Step 1 green.

Mode 4b · Parallel Full Challenge · all three surfaces at once + 3×3 consistency matrix. Unlocks after 3 completed 4a scenarios.

✎ Practice — 18 adaptive MCQs

Distributed across the 5 Problem Detective modes and the 10 traps. Adaptive: weak modes surface 2× more often.

🧪 Practice Exam Mode ON. Recall the answer, then reveal + self-mark.

📊 Practice stats

0Attempts
Accuracy

📋 Exam pool — 12 Paper 2 cited questions

Real Cambridge Paper 2 (P22/P23) problem-statement questions from 2024 and 2025, plus composite exam-style. Write your answer, then self-mark against the mark scheme.

📋 Exam stats

0Attempts
Average mark

🔄 Review — 10 traps + 6 memory triggers

Read before your exam. The examiner-cited traps are the ones the 2025 P22 report flagged.

Examiner-cited & source-cited traps

🧠 Memory triggers

Six one-liners. Recite these before your exam.

🎯 Your weakest modes

💔 Your logged mistakes

🏆 Mastery — 12-item revision checklist

Tick each item as you master it. All 12 ticked → Module Mastered banner.

🏆 Module Mastered — Topic 10 · Lab C · Purpose complete!
🎓 All three labs finished. Topic 10 Boolean Logic conquered.

Revision checklist

Skill grid — per-mode mastery

Mastered = 3+ attempts and ≥70% accuracy. Tap to override.

📊 Session summary

0Modes attempted
0Modes mastered
Complete Problem Detective + Practice to unlock achievements.Achievement
💔 Mistakes

Your mistakes log

Every wrong answer captures here automatically.

📊 Progress

Progress dashboard

Your attempts, accuracy, and mastery counts across Lab C.

Practice

0Attempts
Accuracy

Exam

0Attempts
Avg mark

🎯 Weakest modes

🔖 Bookmarks

Bookmarked questions

📝 My Notes

Personal notes + feedback

Add note

Send feedback

Category
🗄️ Vault

Your knowledge vault

Saved ✓