AQA · GCSE · Computer Science

    Course version: 8525 · Version from Sept 2020

    Remainder: the remainder when 11 is divided by 2 (11 MOD 2) = 1

    Full specification wording

    Arithmetic operations in a programming language: Remainder: the remainder when 11 is divided by 2 (11 MOD 2) = 1

    MOD returns the remainder left after integer division.

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

    • Point 8 of 8

    Study notes

    From the checked teaching notes for this specification point.

    The idea

    MOD returns the remainder left after integer division. To find 11 MOD 2, first see how many whole times 2 fits into 11: it fits five times (2 × 5 = 10). Subtract that from 11 to get the remainder, 11 − 10 = 1, so 11 MOD 2 = 1. The remainder is always less than the divisor, which is a useful check. MOD is closely linked to DIV: for the same numbers, dividend = (quotient × divisor) + remainder, here 11 = (5 × 2) + 1. MOD is used to test whether a number is even or odd (a remainder of 0 after dividing by 2 means even) and to wrap values around a fixed range.

    What earns the marks

    • MOD returns the remainder after integer division.
    • 2 fits into 11 five whole times, giving 2 × 5 = 10.
    • The remainder is 11 − 10 = 1, so 11 MOD 2 = 1.
    • The remainder is always less than the divisor, and dividend = (quotient × divisor) + remainder.

    Common mistakes and how to put them right

    • Giving 5: the learner confuses MOD with DIV.

      Put it right: Is that MOD gives the remainder (1), not the quotient.

    • Giving 0.5: the learner treats the fractional part of ordinary division as the remainder.

      Put it right: Is that the remainder is a whole number found by subtraction.

    • Giving 2 or more.

      Put it right: Is that a valid remainder must be less than 2 here.

    Exam tips

    • Multiply the whole-number quotient by the divisor, then subtract from the dividend to get the remainder.
    • Check that your remainder is smaller than the divisor before selecting an answer.
    • Use the relationship dividend = (quotient × divisor) + remainder to verify DIV and MOD together.

    Try the lesson

    The start of the Arithmetic operations in a programming language: Remainder: the remainder when 11 is divided by 2 (11 MOD 2) = 1 lesson, made from checked teaching notes for this specification point.

    Have a go first

    A program stores the result of 11 MOD 2 in a variable. What value does the variable hold?

    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 Arithmetic operations in a programming language: Remainder: the remainder when 11 is divided by 2 (11 MOD 2) = 1

    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