中文（繁體）
中文（简体）
English
A-Level Computer Science 9618 Paper 3: Structures, Algorithms, Recursion
Computer Science: properties first, steps second
Paper 3 is advanced theory: data structures, algorithms, recursion and databases. The marks sit in the first line – stack is LIFO, queue is FIFO, binary search presumes sorted data, recursion needs a base case – and without it the working earns only the answer mark.
How is A-Level Computer Science 9618 Paper 3 assessed, and what does each part carry?
Paper 3 (Advanced Theory): sections 13-20, 75 marks (25% A-Level); Paper 1 (Theory Fundamentals): sections 1-8, 75 marks (25% A-Level)
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.
What each paper is actually testing
| Paper | Drill focus | How marks are lost |
|---|---|---|
| Paper 3 (Advanced Theory) | data structures, algorithms, OS | The structure is named but its access order and use case are never stated, so the applied part earns half. |
| Paper 1 (Theory Fundamentals) | hardware, software, networks | The precondition (sorted data, input range) or the base case is missing, and the method marks go. |
What is each A-Level Computer Science 9618 Paper 3 paper really testing, and what should you drill?
Paper 3 (Advanced Theory): data structures, algorithms, OS; Paper 1 (Theory Fundamentals): hardware, software, networks
Drill order: by topic, then by year, then the mark scheme
| Step | What you do | Why |
|---|---|---|
| 1. By topic | Work through each topic, starting with the paper that allows least help (no calculator / closed book) | Exposes what is genuinely not understood |
| 2. By year | Whole papers to time, one or two a week | Trains pace, stamina and question selection |
| 3. Mark scheme | Go through the marking scheme question by question and log the scoring steps you missed | Most lost marks are written wrong, not thought wrong |
Should drilling go by topic first or by year?
By topic first, then whole papers by year, then the mark scheme. The first third of the time goes topic by topic (8-10 years of the same topic back to back), the middle switches to timed whole papers, and the last fortnight only redoes the recurring errors from your log.
A 12-week drilling timetable
| Week | Phase | What to do |
|---|---|---|
| Weeks 1-3 | By topic: foundation | Topic by topic, starting with the easiest marks, building habits and recall |
| Weeks 4-6 | By topic: core | 8-10 years of the same topic back to back, errors classified by topic |
| Weeks 7-8 | By topic: advanced and electives | Elective and higher-order topics, now under time pressure |
| Weeks 9-10 | By year: timed papers | One full paper a week, timed, no reference materials |
| Week 11 | Mark scheme work | Question by question against the marking scheme; list the scoring steps you omitted |
| Week 12 | Plug holes and simulate | Only the recurring errors from your log, then one full exam simulation |
Subject-specific weighting for this timetable: Weeks 1-3: data structures. Three lines each – access order, insert and delete cost, one real use.
Weeks 4-6: algorithms. Hand-trace binary search, a sort and a graph traversal, restoring the precondition each time.
Weeks 7-9: recursion and databases. Base case and recursive step first, then the query and the normalisation reason.
Weeks 10-12: whole papers to time at eight minutes a question; redo only the answers missing a precondition or base case.
Use it properly: this is not a checklist to finish. Every week must keep time for redoing errors, or from week 9 you will be repeating the same batch.
Pacing
| Paper | Time | Suggested split |
|---|---|---|
| Paper 3 (Advanced Theory) | 1 h 30 min | about 9 min per question |
| Paper 1 (Theory Fundamentals) | 1 h 30 min | about 9 min per question |
How should the time be split inside each A-Level Computer Science 9618 Paper 3 paper?
Paper 3 (Advanced Theory): about 9 min per question; Paper 1 (Theory Fundamentals): about 9 min per question
The drilling mistakes that cost the most marks
| Mistake | What it looks like | What actually happens | 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 |
The error log and the mark scheme
Three columns: the answer as written, the scheme key words (LIFO or FIFO, sorted, base case, normalisation), and which one was missing. A gap that appears three times earns the last fortnight.
How many years should you drill?
The current syllabus keeps Paper 3 stable, but older 9608 questions use different wording and a narrower range of structures, so do not treat them as the same paper. Three to five years of current papers first, then the official specimen for the newer database and algorithm questions.
How many years of past papers is enough?
The current syllabus keeps Paper 3 stable, but older 9608 questions use different wording and a narrower range of structures, so do not treat them as the same paper. Three to five years of current papers first, then the official specimen for the newer database and algorithm questions.
Frequently asked questions
Is this page a mock paper or a drilling guide?
This is the A-Level Computer Science 9618 Paper 3 drilling guide: assessment structure, drill order, a 12-week timetable, pacing, common mark losses and the error-log method. For questions with answers, use the A-Level Computer Science 9618 Paper 3 mock papers linked under Related.
By topic or by year first?
By topic. Eight to ten years of the same topic back to back is what exposes repeating errors; going straight to whole papers just repeats the same batch under time pressure.
How should the error log be written?
Do not copy out questions. Per error record four things: question reference, which step failed (concept, wording, calculation), what the mark scheme requires, and the correct action next time.
Do I have to state the precondition?
Yes. Sorted data before binary search, the base case before recursion, FIFO before a queue. It is a mark of its own and its absence costs you even when the working is right.
How much detail does a database answer need?
Give the reason for normalising rather than the label: which field depends on which key, and what duplication the split removes.
Official references
| Resource | What to use it for |
|---|---|
| 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.
