Binary arithmetic — AQA GCSE Computer Science

Binary arithmetic forms the core foundation of processor execution, dictating how an Arithmetic Logic Unit (ALU) carries out computational tasks using electronic logic gates. In AQA GCSE Computer Science, students are required to manipulate unsigned binary integers, perform reliable binary additions, and execute logical shifts.

This topic directly links low-level bit representation to real-world software behaviour, teaching students to identify hardware limitations such as overflow errors and integer truncation. Mastering these operations is essential for answering both computational and theory-based architecture questions across Paper 1.

• →Core rules of binary addition: 0+0=0, 0+1=1, 1+1=10 (0 carry 1), and 1+1+1=11 (1 carry 1).
• →Overflow errors: occur when the result of an arithmetic operation exceeds the maximum value an allocated register can hold (e.g. greater than 255 in an 8-bit register).
• →Logical binary shifts: shifting bits left multiplies the value by 2 for each place shifted, while shifting right performs integer division by 2 for each place shifted.
• →Data truncation: right shifts can cause least significant 1 bits to drop off, causing precision loss; left shifts can cause most significant 1 bits to drop off, causing overflow.

• 💡Write both operands right-aligned and label place values 2⁷ to 2⁰ before adding any column.
• 💡Add from the rightmost column leftwards, recording each carry above the next column, and stop after the 8th bit.
• 💡After adding, count the digits in your answer to confirm it is no longer than 8 bits.
• 💡Always clearly show your carry bits directly above or below the addition columns; examiners award working marks even if a minor addition slip occurs.
• 💡When explaining an overflow error, always state the maximum capacity (e.g. 8 bits / 255) and note that the 9th bit cannot be stored in the register.
• 💡Double-check all binary arithmetic by converting the inputs and your final binary answer into denary to guarantee 100% accuracy.

• Writing a 9th bit when the 8th column carries. Correction: the published scope excludes carrying beyond the 8th bit, so answers stay within 8 bits.
• Misaligning operands so the columns do not match place values. Correction: line up both numbers on the right so 2⁰ sits under 2⁰ and 2⁷ under 2⁷ before adding.
• Assuming the answer must always be exactly 8 bits. Correction: the maximum length is 8 bits, so a shorter answer with leading zeros omitted is still valid.
• Writing '2' or '10' directly in a single bit column during addition rather than recording a 0 and carrying 1 to the next place-value column.
• Believing that a logical right shift divides accurately for all integers, forgetting that odd numbers lose their 0.5 fractional component due to bit truncation.
• Thinking overflow means a general program crash rather than a specific condition where an arithmetic result exceeds the fixed capacity of the hardware register.

1. 1Day 1-2: Memorise the four primary binary addition rules and practise 4-bit addition calculations.
2. 2Day 3-4: Progress to 8-bit binary additions involving multiple consecutive carries, verifying each by converting to denary.
3. 3Day 5-6: Practise logical left and right shifts by 1, 2, and 3 places, documenting both binary patterns and arithmetic effects.
4. 4Day 7: Tackle AQA exam-style questions focused on overflow identification and short explanation answers.

• 📋8-bit addition calculations: Direct 2-mark questions requiring addition of two binary numbers with carries shown.
• 📋Overflow analysis questions: 2-3 mark scenario questions asking whether overflow has occurred and requiring an explanation of its impact on the CPU.
• 📋Logical bit shift operations: 1-2 mark questions asking students to shift a given binary pattern and state the new denary value or arithmetic consequence.