Computer Science · A Level

Cambridge A Level Computer Science (9618), one trace at a time

Four papers: two of theory, one of written problem solving and one on a computer. The tutor writes the code on the board and traces it with your child, line by line.

  • First five-minute lesson free
  • No card needed
  • Cancel any time

The four papers

Cambridge International AS & A Level Computer Science 9618. AS Level is Papers 1 and 2. The full A Level adds Papers 3 and 4.

PaperContentTime and marksWeight
1 Theory FundamentalsData representation, networks, hardware, processor, system software, security, ethics, databases1 h 30 min, 75 marksAS 50%, A 25%
2 Problem-solving and ProgrammingAlgorithm design, pseudocode, data types, structured programming, testing2 h, 75 marksAS 50%, A 25%
3 Advanced TheoryFloating point, protocols, virtual machines, compilers, encryption, AI1 h 30 min, 75 marksA 25%
4 PracticalProgramming on a computer: data structures, OOP, recursion, files2 h 30 min, 75 marksA 25%

Paper 4 uses Java, Python or Visual Basic .NET. Check the current 9618 syllabus on the Cambridge International website.

Topics that need the most practice

  • Pseudocode in the Cambridge style

    DECLARE, FOR ... NEXT, WHILE ... ENDWHILE, procedures and functions with parameters.

  • Abstract data types

    Stacks, queues, linked lists and binary trees, with pointers drawn on the board.

  • Searching and sorting

    Linear and binary search, bubble and insertion sort, and their efficiency.

  • Recursion

    Base case, general case and the call stack, traced by hand.

  • Floating-point binary

    Mantissa and exponent in two's complement, and normalisation.

  • Object-oriented programming

    Classes, attributes, methods, inheritance, polymorphism and encapsulation.

Common mistakes

  • Code that is almost pseudocode

    Mixing Python syntax into Paper 2 answers. Examiners accept clear logic, but loops must close.

  • Off-by-one loops

    A loop that runs one time too many or too few. A trace table finds it fast.

  • Theory answers without the term

    Mark schemes look for exact words such as "fetch-execute cycle" or "checksum".

  • No base case

    A recursive function that never stops. Your child must name the base case first.

Try it yourself

Exam-style example (written by Tutorwell). Read this pseudocode function. FUNCTION Sum(n : INTEGER) RETURNS INTEGER, IF n <= 1 THEN RETURN n ELSE RETURN n + Sum(n - 2) ENDIF, ENDFUNCTION. (a) Trace the call Sum(7) and give the value returned. (b) State the base case. (c) State one risk if the base case is removed.

Check your answer

(a) Sum(7) = 7 + Sum(5). Sum(5) = 5 + Sum(3). Sum(3) = 3 + Sum(1). Sum(1) returns 1. The calls then unwind: 3 + 1 = 4, 5 + 4 = 9, 7 + 9 = 16. The function returns 16. (b) The base case is n <= 1, where the function returns n with no further call. (c) Without it, the calls never stop, and the call stack overflows.

A 6-8 week plan before the exams

  1. Week 1: AS or full A Level

    Set the papers and the dates. A short quiz on each topic marks it not started, learning or secure.

  2. Weeks 2-3: pseudocode and tracing

    One algorithm per lesson, written and traced on the board.

  3. Week 4: data structures

    Stacks, queues, linked lists and trees, with pointers drawn as arrows.

  4. Week 5: theory papers

    Short-answer drills with the exact terms from the syllabus.

  5. Weeks 6-7: timed practice

    Original exam-style questions under time, then an error log.

  6. Final week: weak topics only

    Review the topics still marked learning.

How Tutorwell teaches A Level Computer Science

The tutor writes pseudocode on the board and draws a trace table beside it. Your child fills in each row aloud. When a value is wrong, the tutor goes back to that line and asks what the line does.

For Paper 4, your child can upload a photo of their code or an error message. The tutor explains the error but does not write the full program. See debugging a loop and Boolean logic.

Live · Year 10 · IGCSE Maths 14:05
Solve 2x² + 5x − 3 = 0 (2x − 1)(x + 3) = 0 x = −½ or x = 3 check the signs x = ½ or x = −3 checked ✓ −3½
Tutorwell“Your brackets are right. Now, what value of x makes x + 3 equal zero?”
Illustrative example
Illustrative example: an IGCSE maths step on the shared whiteboard. Your child's lesson uses their own subject and level.

Questions parents ask

Does it cover UK A Level boards too?

Yes. Tell the tutor the board, such as AQA or OCR, and it follows that specification. The paper details on this page are for Cambridge 9618.

Which programming language does it teach?

Cambridge pseudocode for Paper 2, and Python, Java or Visual Basic .NET for Paper 4, as your child's school uses.

Can my child run code in the lesson?

The lesson is on a whiteboard, not an editor. Your child runs code on their own computer and shares the result.

Are the questions real past papers?

No. Tutorwell writes its own questions and is not affiliated with Cambridge.

Try a lesson

The first five-minute lesson is free, with no card. Tell the tutor the curriculum, the year and the topic.

Get started

Last checked . Tutorwell is an AI tutor, not a person, and it tells your child so.