ChalkHour

Year 10 Computer Science: Boolean logic lesson pack

A complete, ready-to-teach GCSE lesson on boolean logic. Below is a real sample of what ChalkHour makes: the full pack adds three levels of worksheet, model answers, a teaching explainer and print-ready PDF and Word files.

Get the full pack: start your 14-day trial

£20 today, the rest of your first month on day 14, only if you continue.

Real sample

Introduction to Boolean Logic and Logic Gates

A comprehensive introduction to Boolean logic for Year 10 Computer Science students. The lesson covers the three fundamental logic gates (AND, OR, NOT), how to construct truth tables, and how to interpret simple logic circuits. It aligns with the GCSE Computer Science specifications (AQA/OCR).

Learning objectives

  • Identify and draw the standard symbols for AND, OR, and NOT logic gates.
  • Complete truth tables for individual gates and simple combined logic circuits.
  • Evaluate Boolean expressions involving multiple operators (AND, OR, NOT).
  • Translate between logic gate diagrams, truth tables, and Boolean expressions.

Lesson plan (60 minutes)

  1. Starter · 5 min

    Retrieval practice: Quick-fire questions on binary (0 and 1). Introduction to lesson objectives.

  2. Introduction · 15 min

    Teacher-led explanation of AND, OR, and NOT gates using the explainer script and worked example.

  3. Main Activity · 20 min

    Differentiated worksheet activity. Students work through Support, Core, or Stretch tasks based on prior attainment.

  4. Guided Practice · 10 min

    Logic Circuit Drawing: Students practice drawing simple circuits from Boolean expressions on mini-whiteboards.

  5. Plenary · 10 min

    Multiple-choice quiz to assess learning and address misconceptions.

Key vocabulary

Boolean
A value that can only be one of two states: True or False (1 or 0).
Truth Table
A diagram showing every possible combination of inputs and the resulting output for a logic gate or circuit.
Logic Gate
An electronic component that performs a Boolean operation on one or more inputs.
AND Gate
A gate where the output is 1 only if all inputs are 1.
OR Gate
A gate where the output is 1 if at least one input is 1.

Core worksheet (first questions)

  1. Describe the function of an AND gate and write its Boolean expression.
  2. Describe the function of an OR gate and write its Boolean expression.
  3. A circuit has three inputs: A=1, B=1, C=1. The circuit is: (A AND B) is passed through a NOT gate, then the result is ORed with C. What is the output?
  4. How many rows are needed for a truth table with 3 inputs (A, B, and C)? Show your working.

Quiz (sample)

  1. 1. In an OR gate, if Input A is 1 and Input B is 0, what is the output?

    • A. 0
    • B. 1
    • C. None
    • D. Error

  2. 2. Which gate is often called an 'inverter'?

    • A. AND
    • B. OR
    • C. NOT
    • D. NAND

  3. 3. What condition is required for an AND gate to output 1?

    • A. Both inputs must be 1
    • B. At least one input must be 1
    • C. Both inputs must be 0
    • D. The inputs must be different

The full pack is waiting

Support and Stretch worksheets, every answer and model answer, the teaching explainer and common misconceptions, editable and ready to print as PDF or Word.

Start your 14-day trial

More Computer Science lesson packs