Edexcel GCSE Computer Science Paper 2 practice questions

What is on Paper 2?

• Paper 2 covers application of computational thinking through programming.
• It is a written paper of 2 hours, worth 75 marks — 50% of the GCSE.
• An on-screen practical programming paper using Python.
• Always check the latest specification on your exam board's website, as details can change between exam years.

Paper 2 practice questions with answers

8 original questions across the 4 Paper 2 topics. Try each one before reading the answer.

1. Edexcel Computer Science: papers and exam technique

   1. What is decomposition?

   • • Making code run faster
   • • Breaking a problem into smaller parts
   • • Removing all comments from code
   • • Testing a program with fake data

   Answer: Breaking a problem into smaller parts

   Decomposition means splitting a large problem into smaller, more manageable sub-problems.

2. Edexcel Computer Science: papers and exam technique

   2. What is abstraction in computational thinking?

   • • Adding extra detail to a problem
   • • Removing unnecessary detail to focus on what matters
   • • Writing code in a foreign language
   • • Testing every possible input

   Answer: Removing unnecessary detail to focus on what matters

   Abstraction focuses on the relevant features of a problem and ignores irrelevant detail.

3. Programming fundamentals

   3. What is a variable?

   • • A named storage location that can change value
   • • A fixed value that never changes
   • • A type of loop
   • • An error message

   Answer: A named storage location that can change value

   Variables store data that can be updated while the program runs.

4. Programming fundamentals

   4. Which loop always executes its body at least once?

   • • FOR loop
   • • WHILE loop
   • • REPEAT...UNTIL loop
   • • IF statement

   Answer: REPEAT...UNTIL loop

   REPEAT...UNTIL checks its condition after running the body, so it always runs once.

5. Algorithms: searching, sorting and efficiency

   5. Which searching algorithm requires the list to be sorted?

   • • Linear search
   • • Binary search
   • • Bubble sort
   • • Insertion sort

   Answer: Binary search

   Binary search relies on halving a sorted list, so the list must already be sorted.

6. Algorithms: searching, sorting and efficiency

   6. What is the time complexity of linear search in the worst case?

   Answer: O(n)

   Linear search may need to check every item, giving O(n) worst-case complexity.

7. Boolean logic, databases and SQL

   7. What output does an AND gate give when both inputs are True?

   • • True
   • • False
   • • Undefined
   • • Depends on order

   Answer: True

   AND only outputs True if both inputs are True.

8. Boolean logic, databases and SQL

   8. What does a NOT gate do to its input?

   Answer: It reverses/inverts the input value

   NOT flips True to False and False to True.

Where Paper 2 marks are usually lost

• Giving vague definitions — examiners want the precise technical term.
• Losing marks in trace tables by skipping rows or misreading loop conditions.
• Writing code or pseudocode that ignores the exact input and output the question asks for.
• Answering 'explain' questions with a single fact instead of a fact plus a reason.
• Mixing up binary, denary and hexadecimal conversions under time pressure.

How to pick up the extended-answer marks

• Underline the command word and the focus of the question before writing — most dropped marks come from answering a different question.
• Plan for one or two minutes: three or four points, each backed by evidence and explained.
• Keep linking back to the question in every paragraph, not just the conclusion.
• For 'evaluate' or 'how far do you agree' questions, weigh both sides and finish with a clear judgement.

Timing that works under pressure

• Check the marks per question and give each one time in proportion, keeping spare minutes for checking at the end.
• Bank the short questions first, then return to the longer answers with your remaining time.
• If a question stalls for more than two minutes, write down what you know and move on — partial marks still count.
• Leave five minutes to check spelling of key terms, units and whether any question part was skipped over a page break.

Revise each Paper 2 topic

• Edexcel Computer Science: papers and exam technique (62 questions)
• Programming fundamentals (77 questions)
• Algorithms: searching, sorting and efficiency (77 questions)
• Boolean logic, databases and SQL (77 questions)

Edexcel Computer Science Paper 2 FAQs

What topics are on Edexcel GCSE Computer Science Paper 2?

Paper 2 assesses problem solving and programming in Python, completed on screen.

How long is Edexcel GCSE Computer Science Paper 2?

It is a 2 hours written exam worth 75 marks, which is 50% of the GCSE. Check your board's latest specification for any changes.

How should I revise for Computer Science Paper 2?

Practise answering questions rather than rereading notes. Short daily sets of five questions per topic, marked straight away, expose weak areas faster than a long passive revision session.