中文（繁體）
中文（简体）
English
A-Level Computer Science Past Papers & Drilling (Paper 3): Data Structures, Algorithms, OS
TUTORZONE ORIGINAL DRILLING MOCK · CAMBRIDGE A-LEVEL COMPUTER SCIENCE (9618) PAPER 3
Written to the Cambridge 9618 syllabus (2027-2029): Paper 3 Advanced Theory, 75 marks, 1 h 30 min, 25% of A Level (sections 13-20, all compulsory). This is a Paper 3 drilling mock: 10 questions for 75 marks with answers and techniques.
What is in A-Level Computer Science Paper 3?
Direct answer: Paper 3 Advanced Theory, 75 marks, 1 h 30 min, 25% of A Level (sections 13-20).
Assessment at a glance (2027)
| Component | Content | Weighting | Duration |
|---|---|---|---|
| Paper 3 (Advanced Theory) | sections 13-20, 75 marks | 25% A-Level | 1 h 30 min |
| Paper 1 (Theory Fundamentals) | sections 1-8, 75 marks | 25% A-Level | 1 h 30 min |
A-Level Computer Science Paper 3 drilling technique: 10 questions in 1 h 30 min. Write LIFO/FIFO for data structures; steps and preconditions for algorithms; definitions for concepts.
How this paper was built
This is a TutorZone original drilling mock: the questions follow the Cambridge 9618 structure (Paper 3, 75 marks, 25%) and the answers are our own, not Cambridge past papers or marking references.
Pacing
| Section | Marks | Suggested time | What to do first |
|---|---|---|---|
| Paper 3 (Advanced Theory) | 25% A-Level | about 9 min per question | data structures, algorithms, OS |
| Paper 1 (Theory Fundamentals) | 25% A-Level | about 9 min per question | hardware, software, networks |
Stack vs queue?
Direct answer: stack LIFO, queue FIFO.
Paper 3: structured drilling (10 questions, 75 marks)
LIFO/FIFO for structures; steps and preconditions for algorithms.
Question 1 (8 marks)
Explain the difference between a stack and a queue data structure.
Question 2 (8 marks)
Explain binary search and its precondition.
Question 3 (8 marks)
Explain how an operating system schedules processes.
Question 4 (8 marks)
Explain recursion and give an example.
Question 5 (7 marks)
State the role of cache memory.
Question 6 (7 marks)
Explain the difference between a compiler and an interpreter.
Question 7 (7 marks)
Explain normalisation in a database.
Question 8 (7 marks)
Explain the role of virtual memory in an operating system.
Question 9 (8 marks)
Explain why hash tables are used and one possible problem.
Question 10 (7 marks)
Explain why protocols are used in network communication.
What is the precondition of binary search?
Direct answer: the list must be sorted.
Paper 3 answers
Question 1
A stack is last-in-first-out (LIFO): the last added is removed first (4); a queue is first-in-first-out (FIFO): the first added is removed first (4).
Question 2
Precondition: the list is sorted (3); it compares with the middle element, halving the search each time until found or empty (5).
Question 3
The scheduler picks the next process by a policy (e.g. FCFS, shortest-job-first, round-robin) to share CPU time fairly (8).
Question 4
Recursion is a function calling itself on sub-problems (4); e.g. factorial(n) = n x factorial(n-1) with base case factorial(0)=1 (4).
Question 5
Cache is a fast, small memory holding frequently used data, cutting main-memory access and speeding the CPU (7).
Question 6
A compiler translates the whole program to machine code once before running (4); an interpreter translates and runs line by line (3).
Question 7
Normalisation splits data into linked tables to reduce redundancy and update anomalies and keep consistency (7).
Question 8
Virtual memory pages data out to disk, letting the system run programs larger than physical memory (7).
Question 9
Hash tables give near-O(1) lookup (5); a problem is collisions (different keys map to one slot), which need handling (3).
Question 10
Protocols are rules and formats that let different systems understand each other and transfer reliably (7).
Which topics does this paper drill?
Direct answer: data structures, algorithms, OS, recursion, cache and normalisation.
Where these marks are usually lost
| Mistake | What it looks like | What it costs | Instead |
|---|---|---|---|
| Stack/queue mixed | Stack as FIFO | Stack LIFO, queue FIFO | stack=LIFO, queue=FIFO |
| Binary search precondition | No sorting | Must be sorted first | precondition = sorted |
| Recursion base case | No termination | Recursion needs a base case | factorial(0)=1 base |
How to use this paper
First drill: the full 1 h 30 min on all 10 questions with no references.
Mark it: check data-structure and algorithm steps.
Second drill: redo three to seven days later, aiming to finish inside 1 h 15 min.
What should I do after drilling this paper?
Direct answer: log questions with wrong structures or algorithms; redo in three to seven days; and drill Paper 4 Practical.
FAQ
Is this a Cambridge past paper?
No. The questions and answers are TutorZone originals, not Cambridge past papers or marking references.
What does A-Level Computer Science Paper 3 test?
Advanced theory: data structures, algorithms, operating systems, architecture, 75 marks, 25% of A Level.
Stack vs queue?
Stack LIFO, queue FIFO.
Official references
| Resource | What to check |
|---|---|
| Cambridge A-Level Computer Science 9618 syllabus (2027-2029) | Confirm the Paper 1-4 marks and times |
| https://www.tutorzone.com.hk/en-alevel-computer-science-9618-paper-1-mock-2027/ | A-Level Computer Science Paper 1 drilling mock |
Related: practice area · A-Level Computer Science Paper 1 drilling mock
Next step: find a tutor / register as a tutor
After drilling, the hard part is telling a conceptual error from a writing error. Tell us the year group, the school and your available times, and TutorZone will match you with a tutor who knows the HKEAA assessment requirements.
Demand for tutors in this subject is steady, and those who can explain the marking scheme and where marks are won are especially sought after. Register free; you pay only when a match succeeds.
