This set mixes route-checking decisions with short traces. Questions 1 to 4 test your entry and arrangement checks.
Questions 5 to 8 test traces and notation. Questions 9 and 10 combine both.
All questions are original, and every answer is worked in full.
Try each question on paper first, then open the answer. Log every slip in the mistake log. Belongs to digital versus paper route checking.
Questions
1. A student’s centre confirms in writing: Computer Science, code 0478, exam year 2027. They own a PDF labelled “0478 syllabus 2026-2028” and a video series with no code shown. Which is confirmed as matching, and how should the video be labelled?
Show answer
The PDF covers 2026 to 2028, and 2027 lies in that range, so it matches (confirm on the Cambridge page). The video shows no code or year, so label it “unknown” and check its points against the PDF.
2. Why is the code on its own not enough to choose a syllabus document?
Show answer
The code names the qualification. A document covers a run of exam years, so you also need your exam year.
3. A friend says: “The paper is on screen, so I will sit it at home.” Give two corrections.
Show answer
First, the exam centre arranges where and how papers are sat. Second, the format (screen) is separate from the venue. Ask the centre in writing how each paper is taken.
4. Your centre replies “details later” about your exam series. What do you record?
Show answer
Record the series as “unconfirmed”, keep the date, and ask again. Do not assume a series.
5. Trace and give the output.
Total ← 0
FOR Count ← 1 TO 4
Total ← Total + Count * 2
NEXT Count
OUTPUT TotalShow answer
Count 1: Total = 2. Count 2: Total = 6. Count 3: Total = 12. Count 4: Total = 20. Output 20. Check: 2 + 4 + 6 + 8 = 20.
6. Trace and give the output.
N ← 27
Steps ← 0
WHILE N > 10
N ← N - 8
Steps ← Steps + 1
ENDWHILE
OUTPUT Steps, NShow answer
| Test N > 10 | N after | Steps after |
|---|---|---|
| 27 > 10 true | 19 | 1 |
| 19 > 10 true | 11 | 2 |
| 11 > 10 true | 3 | 3 |
| 3 > 10 false | stop |
Output: 3 and 3. Check: 27 - 8 - 8 - 8 = 3, after three subtractions.
7. How many times does this Python loop run, and which values does i take?
for i in range(1, 5):
print(i)Show answer
It runs 4 times, with i = 1, 2, 3, 4. The value 5 is not included.
8. Write the pseudocode loop header that gives the same four values of i.
Show answer
FOR i ← 1 TO 4. In pseudocode the end value is included.
9. A forum post says a different Computer Science code will replace yours next year. It has no link. Classify the claim and say what you change in your plan.
Show answer
Open, because there is no source. Check the Cambridge page for your code and ask your centre. Change nothing until a source and your centre agree.
10. Convert this Python to pseudocode, then trace it.
count = 0
for n in range(3, 8):
if n % 2 == 1:
count = count + 1
print(count)Show answer
Pseudocode:
Count ← 0
FOR N ← 3 TO 7
IF N MOD 2 = 1
THEN
Count ← Count + 1
ENDIF
NEXT N
OUTPUT Countrange(3, 8) gives 3, 4, 5, 6, 7. Odd values are 3, 5 and 7, so Count goes 1, 2, 3. Output 3. Check: three odd numbers in 3 to 7.
If you got these wrong
- Questions 1 and 2 (entry and document match): go back to identify the entry code.
- Question 3 (screen versus home): revisit why a screen-based route is not a home exam.
- Question 4 (unconfirmed replies): see check local centre availability.
- Questions 5 to 8 and 10 (traces and notation): review linking a concept to the correct profile, then practise in the pseudocode trace trainer and the Python sandbox.
- Question 9 (open claims): see treat 0265 availability as source-gated.
If one error type keeps returning, our online one-to-one Computer Science tuition can go through your working with you.