Mathematics — AQA GCSE Computer Science

Test yourself on Mathematics with AQA GCSE practice questions.

7 days Premium · Then free forever · No card, no charge

Mathematics explained

This subtopic covers fundamental mathematical concepts and algebraic techniques essential for computer science, including number systems (binary, hexadecimal), arithmetic operations, and algebraic manipulation.

Read the full explanation

These skills are applied in areas such as data representation, algorithm design, and problem-solving, forming the basis for more advanced computational thinking.

Your focus

Convert between binary, decimal, and hexadecimal number systems
Perform binary arithmetic including addition and subtraction
Apply algebraic techniques to solve equations

Show all 5 objectives

Manipulate algebraic expressions to simplify or rearrange
Use logical reasoning to solve problems involving number bases

Mathematics exam tips

Quick Revision Summary (Key Takeaway)

Mathematics in AQA GCSE Computer Science underpins algorithm design, data representation, and system architecture, requiring students to master arithmetic operators, integer division (DIV), modulus (MOD), and exponentiation. Proficiency in these mathematical operations allows candidates to calculate file storage capacities, manipulate data structures, and trace algorithmic logic accurately without a calculator.

Topic Overview

Mathematics in AQA GCSE Computer Science forms the underlying foundation of computer programming, data representation, and system design. Candidates must apply arithmetic principles, including integer division, modulo arithmetic, exponentiation, and binary mathematics, to formulate correct algorithmic logic and solve concrete problems.

Beyond programming operators, mathematical reasoning is required to calculate data capacities, sound and image file sizes, and network transmission speeds. Developing confidence in non-calculator arithmetic ensures precision across both Paper 1 computational problem-solving and Paper 2 theoretical concepts.

Key Concepts

→Arithmetic operators: addition (+), subtraction (-), multiplication (*), real division (/), integer division (DIV or //), and remainder modulus (MOD or %).
→Exponentiation: raising numbers to powers using the '^' or '**' operator in algorithms.
→Data representation mathematics: applying formulas to calculate image file sizes (width * height * colour depth) and sound file sizes (sample rate * resolution * length * channels).
→Binary and hex mathematics: place value calculations, binary shifts (multiplying and dividing by powers of 2), and units of data measurement.

Marking Points

Award credit for correct conversion between number systems with clear working
Award credit for accurate binary addition and subtraction, including handling carries and borrows
Award credit for solving linear equations correctly and showing all steps
Award credit for simplifying algebraic expressions correctly
Award credit for applying appropriate methods to solve problems involving number bases

Examiner Tips

💡Practice conversions between binary, decimal, and hexadecimal regularly to build fluency
💡Show all working in arithmetic and algebra to gain method marks even if the final answer is wrong
💡Check answers by converting back to the original base or substituting into equations
💡Familiarize yourself with common powers of 2 to speed up binary conversions
💡Always write out each step of your working clearly. AQA mark schemes award method marks for the correct equation setup even if a mental arithmetic slip occurs in the final answer.
💡Memorise powers of 2 up to 2^10 (1024), as these numbers occur repeatedly in binary conversions, storage prefixes, and colour depth calculations.
💡Double check whether an exam question asks for file size in bits, bytes, kilobytes (KB), or kibibytes (KiB) before concluding your working.

Common Mistakes

Confusing binary and decimal place values, leading to incorrect conversions
Forgetting to carry over in binary addition or borrow in subtraction
Misapplying algebraic rules, such as incorrect distribution or combining like terms
Using decimal arithmetic when binary is required
Assuming standard division (/) produces an integer; in computer science, real division returns a floating-point value, whereas DIV truncates the decimal part to return an integer.
Confusing bits and bytes in media calculations, leading to answers that are a factor of 8 too large because the initial result in bits was not converted.
Believing calculators are allowed in the examination; all calculations in AQA GCSE Computer Science must be performed using mental arithmetic or written long-hand methods.

Revision Plan

1Step 1: Practice integer arithmetic problems using DIV and MOD with varied integers until distinguishing between quotient and remainder is second nature.
2Step 2: Memorise and practice applying the core formulas for image, sound, and text storage size without using a calculator.
3Step 3: Drill binary shifts and bitwise calculations, checking your work by converting binary values back to denary.
4Step 4: Complete past Paper 1 and Paper 2 calculation questions under timed conditions to improve non-calculator speed and accuracy.

Exam Question Types

📋Non-calculator file size calculations: Multi-mark questions requiring step-by-step arithmetic to determine image, sound, or database file sizes.
📋Trace tables with arithmetic: Stepping through loops and conditional statements featuring DIV, MOD, and exponentiation to determine final variable values.
📋Algorithm implementation: Writing pseudocode or high-level code that uses mathematical operators to solve practical real-world problems (e.g. converting currency, calculating bus capacities).

Command Word Expectations (AQA)

Calculate

Perform mathematical operations to produce a numerical result. Show full working out, as method marks are available even if the final figure is incorrect.

Determine

Establish the only valid outcome, value, or algorithmic state through logical analysis of the provided data or pseudocode.

State

Provide a concise numerical value, formula, or factual answer without showing working or explanatory justification.

How Students Lose Marks (Examiner Pitfalls)

Pitfall: Confusing integer division (DIV) with modulus (MOD) when processing remainders and quotients.

❌ Weak Answer (Loses Marks):17 MOD 5 is 3 because 5 goes into 17 three times.

Example improved answer:17 MOD 5 = 2. DIV calculates the whole quotient (17 DIV 5 = 3), whereas MOD calculates the remainder left over after integer division (17 - (3 * 5) = 2).

Examiner Tip: Always remember that MOD gives you what is leftover. Use 'x MOD 2 == 0' as standard code to test for even numbers.

Pitfall: Forgetting that standard file size calculation formulas output bits rather than bytes.

❌ Weak Answer (Loses Marks):File size = 800 * 600 * 16 = 7,680,000 bytes, which is 7.68 MB.

Example improved answer:Total bits = 800 * 600 * 16 = 7,680,000 bits. To convert to bytes, divide by 8: 7,680,000 / 8 = 960,000 bytes. To convert to megabytes (MB): 960,000 / 1,000,000 = 0.96 MB (or 960,000 / 1,048,576 = 0.92 MiB).

Examiner Tip: Label your units at every single stage of your calculation. Start with bits, explicitly show division by 8 to reach bytes, and then convert to higher storage prefixes.

Step-by-Step Worked Solutions

Question: A mono audio track is recorded with a sample rate of 44,100 Hz and a sample resolution of 16 bits. Calculate the raw file size in megabytes (MB) for a 30-second recording. Show all your working.

1.Step 1: Identify given values and formula. Sound file size (bits) = sample rate (Hz) * sample resolution (bits) * duration (s) * number of channels.
2.Step 2: Calculate total bits. Total bits = 44,100 * 16 * 30 * 1 = 21,168,000 bits.
3.Step 3: Convert bits to bytes by dividing by 8. Bytes = 21,168,000 / 8 = 2,646,000 bytes.
4.Step 4: Convert bytes to megabytes (MB) using decimal prefix 10^6 (1,000,000 bytes = 1 MB). MB = 2,646,000 / 1,000,000 = 2.646 MB (or using binary prefix 2^20: 2,646,000 / 1,048,576 = 2.52 MiB).

Final Answer: 2.65 MB (or 2.52 MiB to two decimal places)

Question: An algorithm takes an input representing a time interval in total seconds ('totalSecs') and converts it into whole minutes and remaining seconds. Write pseudocode to assign the correct values to variables 'minutes' and 'remainingSecs'.

1.Step 1: Recognise that whole minutes are determined by integer division of total seconds by 60.
2.Step 2: Recognise that remaining seconds are the remainder when total seconds are divided by 60.
3.Step 3: Apply the DIV operator for integer division: minutes = totalSecs DIV 60.
4.Step 4: Apply the MOD operator for remainder division: remainingSecs = totalSecs MOD 60.

Final Answer: minutes = totalSecs DIV 60 remainingSecs = totalSecs MOD 60

Active Recall Memory Test

What are the exact outputs of 29 DIV 6 and 29 MOD 6?

Key Fact: 29 DIV 6 = 4; 29 MOD 6 = 5.

What is the formula to calculate the size of an uncompressed bitmap image in bits?

Key Fact: Image size (bits) = width (in pixels) * height (in pixels) * colour depth (in bits per pixel).

What arithmetic effect does a logical binary shift to the right by 3 places have on an unsigned integer?

Key Fact: It performs integer division by 8 (2^3), discarding any remainder.

How many distinct values can be represented using an 8-bit unsigned binary integer?

Key Fact: 256 distinct values (ranging from 0 to 255, calculated as 2^8).

Frequently Asked Questions

Are calculators allowed in AQA GCSE Computer Science exams?

No, calculators are strictly prohibited in both Paper 1 and Paper 2 of the AQA GCSE Computer Science exam. All questions requiring mathematical calculations are written to use accessible numbers, assessing your understanding of core concepts rather than complex arithmetic. You should regularly practice manual long division, multiplication, and power-of-two arithmetic during revision.

What is the difference between DIV and MOD in pseudocode?

DIV performs integer division, which divides two numbers and returns only the integer quotient while discarding any remainder or fractional part (for example, 14 DIV 4 = 3). In contrast, MOD calculates the remainder remaining after integer division has taken place (for example, 14 MOD 4 = 2). Both operators are critical for tasks like time conversion, currency calculation, and parity checking.

Does AQA accept 1000 or 1024 for data storage conversions?

AQA recognizes both decimal SI prefixes (where 1 KB = 1000 bytes) and binary IEC prefixes (where 1 KiB = 1024 bytes). In exams, mark schemes frequently accept calculations using either 1000 or 1024 unless the question explicitly specifies binary prefixes (kibibytes/mebibytes). To guarantee marks, always write out your division or multiplication clearly so examiners can follow your chosen base.

How do I calculate sound file size for stereo tracks?

To calculate the file size of a sound recording in bits, multiply the sample rate (Hz) by the sample resolution (bits), duration (seconds), and the number of channels. For a mono recording, the number of channels is 1, but for a stereo track, you must multiply by 2. Finally, divide the total bits by 8 to convert the result into bytes.

Why is the MOD operator so useful for checking odd and even numbers?

Even numbers are evenly divisible by 2 with a remainder of 0, whereas odd numbers always leave a remainder of 1 when divided by 2. By using the expression 'number MOD 2', an algorithm can instantly determine parity: if the output is 0, the number is even; if the output is 1, the number is odd. This forms a common pattern in validation routines and conditional statements.

Mathematics explained

Your focus

Mathematics exam tips

More AQA GCSE Computer Science topics

Cookies on MasteryMind