AQA · GCSE · Computer Science

    Course version: 8525 · Version from Sept 2020

    Students will be expected to understand and use the following Boolean…

    Full specification wording

    Boolean logic: Students will be expected to understand and use the following Boolean expression operators:

    Understanding means knowing what each operator does to its inputs and outputs; using means applying them in expressions and truth tables.

    Checked against the AQA 8525 specification (opens in a new tab) on .

    • Point 11 of 16

    Study notes

    From the checked teaching notes for this specification point.

    The idea

    Understanding means knowing what each operator does to its inputs and outputs; using means applying them in expressions and truth tables. NOT is unary and inverts one value. AND is binary and gives 1 only when both inputs are 1. OR gives 1 when at least one input is 1. XOR gives 1 when the inputs differ. Recognise each operator's symbol and name, then apply it correctly when building or evaluating an expression.

    For example: With A = 1 and B = 0, A AND B = 0, A OR B = 1, A XOR B = 1 and NOT A = 0.

    What earns the marks

    • NOT is a unary operator that inverts a single Boolean value.
    • AND is a binary operator that outputs 1 only when both inputs are 1.
    • OR is a binary operator that outputs 1 when at least one input is 1.
    • XOR is a binary operator that outputs 1 when the two inputs differ.
    • Each operator can be applied to given input values to produce a correct output.
    • Operators can be combined in expressions and checked with a truth table.

    Common mistakes and how to put them right

    • Confusing the behaviour of OR and XOR.

      Put it right: XOR gives 0 when both inputs are 1, while OR gives 1.

    • Treating NOT as a binary operator.

      Put it right: NOT applies to a single value.

    • Mixing up which operator needs all inputs to be 1.

      Put it right: AND requires every input to be 1.

    Exam tips

    • Learn each operator's output rule so you can state results quickly for given inputs.
    • Practise applying operators to two-input combinations to build confidence with truth tables.
    • Check whether an operator is unary or binary before applying it.

    Try the lesson

    The start of the Boolean logic: Students will be expected to understand and use the following Boolean expression operators: lesson, made from checked teaching notes for this specification point.

    Have a go first

    Which Boolean operator is represented by the symbol '+' in Boolean algebra?

    There is more to this lesson

    The full lesson goes on to check your understanding and help you earn the marks. Create a free account to carry on, with your progress saved.

    Carry on with the full lesson

    A week of Premium from your first lesson · Then the free plan continues · No card, no charge

    Test your understanding of Boolean logic: Students will be expected to understand and use the following Boolean expression operators:

    Active recall beats re-reading. Take an instant quiz now to test what you’ve learned and lock it into long-term memory.

    Take topic quiz

    A week of Premium from your first lesson · Then the free plan continues · No card, no charge