Boolean Logic Masterclass
J277 Specification Reference: 2.4 Boolean logic
Learning Objectives
Why this matters
Computers make decisions using simple True/False rules, just like strict parents.
Rule 1: AND (Strict)
"You can play if you have finished homework AND tidied your room."
Rule 2: OR (Relaxed)
"You can play if it is the weekend OR if it is a holiday."
1. Core Knowledge: The Gates
Tap cards to flipAND
Tap for definition
AND Gate
Output is 1 only if BOTH inputs are 1.
Also called: Conjunction
OR
Tap for definition
OR Gate
Output is 1 if EITHER (or both) inputs are 1.
Also called: Disjunction
NOT
Tap for definition
NOT Gate
Output is the INVERSE (opposite) of the input.
Warning: Don't forget the circle!
Checkpoint 1
I can recognise and name the 3 logic gates.
Logic Lab
2. Mastering Truth Tables
The AND Rule
Output is 1 only if A AND B are 1.
| A | B | Output Q |
|---|---|---|
| 0 | 0 | ? |
| 0 | 1 | ? |
| 1 | 0 | ? |
| 1 | 1 | ? |
Checkpoint 2
I can complete truth tables for 2 and 3 inputs.
Diagram Bootcamp
How to Decompose a Question
Exam Question: "The Alarm (Q) sounds if the Motion Sensor (A) is on, AND the System is Armed (B), OR if the Panic Button (C) is pressed."
"Motion AND Armed" belong together. Draw an AND gate for A and B first.
Take the output line from that gate, and plug it into an OR gate along with input C.
Scenario: The Garden Floodlight
"The light (Q) turns on if the Switch is ON (C) AND motion is detected (A) at Night (NOT B)."
Checkpoint 3
I can create and edit diagrams from written scenarios.
Final Assessment
1. Which symbol represents a NOT gate?
2. Reverse Engineering
Look at this truth table. Which gate produces this output?
| A | B | Output |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
3. Logic Tracing
System: P = NOT A AND (B OR C).
If A=1, B=1, C=1,
what is P?
Hint: Work out NOT A first.
Checkpoint 4
I can apply logical operators to solve problems.