boolean operations
4 detailed 50-minute lessons with teaching scripts, worked examples, parent guides, and assessment criteria.
Lesson Overview
Total Lessons: 4
Tier: Foundation and Higher
Duration: 50 minutes per lesson (200 minutes total)
Exam Boards: AQA, Edexcel, OCR, Eduqas, CCEA
Tier: Foundation and Higher
Duration: 50 minutes per lesson (200 minutes total)
Exam Boards: AQA, Edexcel, OCR, Eduqas, CCEA
Learning Objectives
- Explain the key ideas of boolean operations
- Apply boolean operations to exam-style questions
- Develop independent study skills
- Build cross-topic connections
Prerequisites
- Read the revision notes for boolean operations first (GCSE Revise summary)
- Key vocab to pre-teach: Boolean operations, NOT, AND
- Basic skills: reading the summary notes and answering the practice questions there
Materials & Equipment
- Exercise book, coloured pens
- Ruler
- Printed revision notes (link below)
- Internet for videos (see Resources)
Lesson 1: Introduction: boolean operations
Duration: 50 minutes
Starter Activity (5 minutes)
Quick Recall
Write down everything you already know about boolean operations. Then check against the key terms: Boolean operations, NOT, AND. Use a mini-whiteboard or paper.
Main Content (35 minutes)
Parent/Teacher Guide:
Before lesson: Read the script below. Pre-teach key vocab: Boolean operations, NOT, AND.
If stuck: Re-read the revision notes (link above), then break the content into smaller steps.
Extension: See the Stretch & Challenge ideas in Lesson 4.
Before lesson: Read the script below. Pre-teach key vocab: Boolean operations, NOT, AND.
If stuck: Re-read the revision notes (link above), then break the content into smaller steps.
Extension: See the Stretch & Challenge ideas in Lesson 4.
Teaching Script (35 mins):
Mins 0-5 - Hook: "Today: boolean operations. By the end you will be able to answer exam questions on it unaided. It connects to the rest of Computer Science because the ideas here recur across the spec."
Mins 5-20 - Direct Instruction: Work through the core ideas below one at a time; after each, ask your student to explain it back in their own words.
Mins 20-30 - Guided Practice: Model the worked example together, then let your student attempt the first practice question with guidance.
Mins 30-35 - Independent Practice: 2-3 practice questions from Lesson 3 below, with immediate feedback.
Mins 0-5 - Hook: "Today: boolean operations. By the end you will be able to answer exam questions on it unaided. It connects to the rest of Computer Science because the ideas here recur across the spec."
Mins 5-20 - Direct Instruction: Work through the core ideas below one at a time; after each, ask your student to explain it back in their own words.
Mins 20-30 - Guided Practice: Model the worked example together, then let your student attempt the first practice question with guidance.
Mins 30-35 - Independent Practice: 2-3 practice questions from Lesson 3 below, with immediate feedback.
First Look
Start with the revision notes summary, then attempt: Complete the truth table for A AND B where A = TRUE, B = FALSE.
Plenary (5 minutes)
Check Out
Your student states one thing they learned and one question they still have about boolean operations.
Lesson 2: Core Concepts: boolean operations
Duration: 50 minutes
Starter Activity (5 minutes)
Review Previous Lesson
Quick recap: write 3 key points from Lesson 1 on boolean operations. Check them against the notes below.
Main Content (35 minutes)
Boolean operations: work on Boolean values (TRUE and FALSE) to produce a Boolean result. They are used to combine or invert conditions in IF statements and WHILE loops.
NOT: reverses a Boolean value. NOT TRUE = FALSE, NOT FALSE = TRUE. It is used to invert a condition.
AND: returns TRUE only when BOTH conditions are TRUE. If either one is FALSE, the result is FALSE.
OR: returns TRUE when at least ONE condition is TRUE. Only returns FALSE when BOTH conditions are FALSE.
You can combine multiple Boolean operators: in a single condition. Use brackets to make the order of evaluation clear.
Brackets matter!: The condition "A AND B OR C" is ambiguous. It could mean "(A AND B) OR C" or "A AND (B OR C)" which give different results. Always use brackets to make your intention clear.
| Term | Meaning | Example |
|---|---|---|
| TRUE | FALSE | |
| FALSE | TRUE | |
| TRUE | TRUE | TRUE |
| TRUE | FALSE | FALSE |
| FALSE | TRUE | FALSE |
| FALSE | FALSE | FALSE |
| TRUE | TRUE | TRUE |
| TRUE | FALSE | TRUE |
Practice (10 minutes)
Q: Complete the truth table for A AND B where A = TRUE, B = FALSE.
Answer: TRUE AND FALSE = FALSE. Both must be TRUE for AND to return TRUE.
Plenary (5 minutes)
Explain Back
Your student teaches the key points back to you without looking. Fill any gaps immediately.
Lesson 3: Application: boolean operations
Duration: 50 minutes
Starter Activity (5 minutes)
Quick Recall
Recall the key terms: Boolean operations, NOT, AND. Define each in one sentence.
Main Content (35 minutes)
Parent/Teacher Guide: Let your student attempt each question alone first, then compare with the model answer. Award method marks for correct working even if the final answer is wrong.
Q1: Complete the truth table for A AND B where A = TRUE, B = FALSE.
Answer: TRUE AND FALSE = FALSE. Both must be TRUE for AND to return TRUE.
Q2: Evaluate: NOT (TRUE OR FALSE)
Answer: TRUE OR FALSE = TRUE. Then NOT TRUE = FALSE.
Q3: Use De Morgan's Laws to simplify: NOT (x >= 0 AND x <= 100)
Answer: Using De Morgan's: NOT(x >= 0) OR NOT(x <= 100) = x < 0 OR x > 100.
Q4: Write a condition that checks if a person is eligible for a student discount (age < 18 OR hasStudentCard = TRUE) AND isShopping = TRUE.
Answer: IF (age < 18 OR hasStudentCard = TRUE) AND isShopping = TRUE THEN OUTPUT "Student discount applied" ENDIF
Q5: Evaluate step by step: NOT FALSE AND TRUE OR FALSE
Answer: Step 1: NOT FALSE = TRUE (NOT has highest precedence). Step 2: TRUE AND TRUE = TRUE (AND next). Step 3: TRUE OR FALSE = TRUE (OR lowest). Result: TRUE.
Plenary (5 minutes)
Error Review
Review any questions answered incorrectly. Identify whether the error was knowledge, method, or reading the question.
Lesson 4: Exam Practice: boolean operations
Duration: 50 minutes
Starter Activity (5 minutes)
Command Words
Review what these command words require: state (one point), describe (say what happens), explain (say why), compare (both sides), evaluate (judgement).
Main Content (35 minutes)
Extended Answer
Extended question: Full-Mark Response A login system requires a username of at least 5 characters AND a password of at least 8 characters. The user is locked out after 3 failed attempts. Write pseudo-code using Boolean operators to implement this. [5 marks] <div class="
attempts ← 0 loggedin ← FALSE WHILE attempts = 5 AND LENGTH(password) >= 8 THEN OUTPUT 'Login successful' loggedin ← TRUE ELSE attempts ← attempts + 1 IF NOT loggedin AND attempts
Exam Tips: Memorise the truth tables for NOT, AND, and OR | AND needs BOTH to be TRUE; OR needs at least ONE | Use brackets whenever combining AND and OR in the same condition | De Morgan's: NOT(AND) becomes OR of NOTs, NOT(OR) becomes AND of NOTs | Precedence: NOT first, then AND, then OR | When simplifying conditions, apply De Morgan's Laws to make code clearer
Common Errors: ✗ Thinking AND and OR are interchangeable ✓ AND requires ALL conditions to be true; OR requires at least ONE condition to be true. They produce different results and are not interchangeable. ✗ Forgetting that NOT reverses a Boolean value ✓ NOT TRUE = FALSE and NOT FALSE = TRUE. NOT flips the result — it is used to negate conditions, e.g. WHILE NOT finished. ✗ Assuming AND is evaluated before OR without brackets ✓ AND has higher precedence than OR in most languages. Use brackets to make intent clear: (A OR B) AND C is different from A OR (B AND C). ✗ Confusing NOT with negative numbers or minus signs ✓ NOT is a logical operator that reverses True/False. It is not the same as the arithmetic mi
Stretch & Challenge (Grade 8-9):
- Synoptic links: explain how boolean operations connects to another Computer Science topic you have studied
- Real-world: research one real-world use or example of boolean operations
- Critical: "What are the limitations of the models used in boolean operations?"
Plenary (5 minutes)
Assessment Criteria
- Got it: Confident explanation + correct worked examples
- Getting there: Main points OK, needs support with detail
- Not yet: Confused on key concepts - re-run Lesson 2
Homework & Consolidation
- Consolidation: Re-answer any Lesson 3 practice questions answered incorrectly (20 mins)
- Retrieval: Write flashcards for the key terms: Boolean operations, NOT, AND (10 mins)
- Exam practice: One past-paper question on boolean operations from the board websites (15 mins)
- Extension: Explain boolean operations to someone else in your own words (10 mins)