Cambridge AS & A Level Computer Science 9618/32 October/November 2025 (Paper 3 Advanced Theory): Question-by-Question Guide
Cambridge AS & A Level Computer Science 9618/32 is the October/November 2025 Paper 3 (Advanced Theory), variant 2. It is an A Level component that lasts 1 hour 30 minutes, is worth 75 marks and is sat by every full A Level candidate. It had twelve compulsory questions and no calculator, each worth between 4 and 9 marks, so the paper ranged across almost the whole A Level theory syllabus. This guide goes through the paper question by question and shows what the official mark scheme gave marks for. The paper and its mark scheme are free on the Tutopiya Learning Portal.
For the newest series of the same paper, see 9618 Paper 32 May/June 2026: questions and mark scheme.
For an overview of all four 9618 papers from this series, see A Level Computer Science 9618 Oct/Nov 2025 Papers & Marking.
9618/32 at a glance
Paper codes: the code printed on the cover is 9618/32/O/N/25, the question paper file is 9618_w25_qp_32 and the mark scheme file is 9618_w25_ms_32.
| Question | Topic | Marks | Main command word |
|---|---|---|---|
| 1 | A Car record type and an enumerated type | 6 | Write |
| 2 | Floating-point to denary and denary to floating-point | 6 | Calculate |
| 3 | HTTP, IMAP and the BitTorrent protocol | 6 | State, describe |
| 4 | Circuit switching and packet switching | 4 | Identify |
| 5 | Interrupts in low-level scheduling, process states | 5 | Describe, complete |
| 6 | Logic circuit truth table, K-map, sum-of-products | 9 | Complete, draw, write |
| 7 | Cryptography and asymmetric keys | 5 | Identify, explain |
| 8 | Compiler optimisation and Reverse Polish Notation | 8 | State, convert, show |
| 9 | Deep learning and back propagation | 6 | State, identify, describe |
| 10 | Exceptions | 4 | Describe, identify |
| 11 | Assembly language with indirect addressing | 7 | Write |
| 12 | A stack: Push(), using it, and recursion | 9 | Complete, write, explain |
| Total | 75 |
Question-by-question walkthrough
Question 1: user-defined types (6 marks)
- A variable of type Car (1 mark): for example DECLARE Car1 : Car.
- Assigning two fields (2 marks): Car1.Colour ← “Blue” (1) and Car1.IntoStock ← 21/10/2025 (1), using dot notation.
- The enumerated type (2 marks): TYPE Body = (Convertible, Hatchback, Saloon, SUV). One mark for TYPE Body = and one for the bracketed list.
- Updating BodyStyle (1 mark): DECLARE BodyStyle : Body.
Question 2: floating-point (6 marks)
The system uses a 10-bit mantissa and a 6-bit exponent, both in two’s complement.
- 0111100101 001011 to denary (3 marks): the exponent 001011 is 8 + 2 + 1 = 11. Moving the binary point 11 places right turns 0.111100101 into 11110010100, which is 1024 + 512 + 256 + 128 + 16 + 4 = 1940. Two marks for working (applying the exponent and a correct method) and one for the answer. A fractions method was also shown.
- +26.6875 to normalised floating-point (3 marks): 26.6875 is 16 + 8 + 2 + 0.5 + 0.125 + 0.0625, which is 11010.1011. The point moves 5 places, so the normalised mantissa is 0110101011 and the exponent is 000101. One mark each for converting to binary, using the exponent correctly and writing the answer in the space provided. A positive normalised mantissa starts 01.
Question 3: application layer protocols (6 marks)
- HTTP and IMAP (2 marks): HTTP sends and receives web pages, hypertext, images or videos; IMAP lets users read their emails from any device without removing them from the mail server, so the mailbox stays in sync across devices.
- How BitTorrent shares files (4 marks): any four of ten points: files are shared over a peer-to-peer network; a peer first creates a small torrent (descriptor) file holding metadata about the file; the whole file must start on at least one peer; it is broken into equal-sized pieces; other peers get the torrent file and connect to a tracker, which holds data about all the computers in the swarm; each peer downloads pieces from other peers until it has the whole file; each piece received makes that peer a source for it; and a peer that has the complete file and shares it is a seed.
Question 4: switching (4 marks)
- One benefit of each (2 marks): for circuit switching, for example the connection stays available for the whole transmission, a dedicated path gives a steady rate and less chance of lost data, and data arrives in order with no reordering delay. For packet switching, for example the line isn’t tied up so bandwidth is shared, packets can be re-routed round faulty or busy lines, lost packets can be resent individually, and the high possible data rate.
- Two differences (2 marks): for example circuit switching sets up a dedicated path before transfer while packet switching starts straight away; circuit switching uses the whole bandwidth while packet switching shares it; all data follows one route in circuit switching while packets can take any route; data arrives in order in circuit switching but packets may need reordering; and lost data means resending the whole transmission in circuit switching but only the lost packets in packet switching. Each difference needs both sides.
Question 5: the operating system (5 marks)
- Interrupts in low-level scheduling (2 marks): any two of: the low-level scheduler handles interrupts by priority, so critical events are dealt with without delay; and it uses an interrupt vector table (or interrupt despatch table) lookup to map each interrupt to its interrupt service routine.
- A reason for each process state (3 marks): running, the process has been allocated CPU time and is being executed; ready, it is waiting in the ready queue for a time slice, or has been displaced by a higher-priority process; blocked, it is waiting for an I/O operation or another event to complete.
Question 6: logic (9 marks)
- Truth table (3 marks): P is NOT B, Q is A XOR P, R is B XOR C, S is a three-input AND of Q, P and R, and Z is a three-input OR of S, P and R. One mark for all four working columns P, Q, R and S, one for the first four rows of Z and one for the last four. For inputs 000 to 111 in order, Z is 1, 1, 1, 0, 1, 1, 1, 0. Z is 0 only when B and C are both 1.
- Completing the K-map (2 marks): with BC in the order 00, 01, 11, 10, the A = 0 row is 0, 1, 1, 0 and the A = 1 row is 0, 1, 0, 1. Two marks for no errors, one for one error.
- Loops (2 marks): one loop around the pair in the A = 0 row (BC = 01 and 11) and one around the BC = 01 column. The 1 at A = 1, BC = 10 cannot join any group.
- Simplified sum-of-products (2 marks): NOT A.C + NOT B.C + A.B.NOT C. One mark for one correct term with an OR sign, and one for every term and operator correct with nothing extra.
Question 7: encryption (5 marks)
- Another type of cryptography (1 mark): symmetric, or quantum cryptography.
- Using two keys to receive a secure transmission (4 marks): the organisation’s two keys are a private key and a public key; it makes the public key available to anyone who wants to send it data; the sender encrypts the message with the organisation’s public key; and the organisation decrypts it with its private key.
Question 8: compilation and RPN (8 marks)
- The optimisation stage (1 mark): to improve the code so it uses minimum resources, such as program storage, CPU time, memory or execution time.
- RPN to infix (3 marks): a b − c + c a − * d / becomes (a − b + c) * (c − a) / d. One mark each for (a − b + c), * (c − a) and / d.
- Evaluating c a / b d − * b + (4 marks): with a = 3, b = 16, c = 9 and d = 6, the stack goes 9; 9, 3; then the division leaves 3. Pushing b and d gives 3, 16, 6, and the subtraction leaves 3, 10. The multiplication leaves 30. Pushing b gives 30, 16, and the addition leaves 46. One mark per stage of the stack.
Question 9: deep learning (6 marks)
- A use of deep learning (1 mark): for example virtual assistants, chatbots, self-driving cars, natural language processing, fraud detection, image or facial recognition, translation, large language models or weather forecasting.
- Making it more effective (1 mark): use more hidden layers.
- Back propagation of errors (4 marks): any four of: the initial outputs are compared with the expected outputs; the weightings are adjusted to reduce the difference; calculus is used to find the error gradient; the results are fed back into the neural network; the weightings of each node are adjusted as a result; and the process repeats until the results are more accurate.
Question 10: exceptions (4 marks)
- Avoiding termination (2 marks): use an exception handling routine to respond to unexpected events while the program runs, for example with try … except (or catch), or by generating an error message.
- Two causes (2 marks): coding errors, user errors, and hardware failure such as losing connection to a printer.
Question 11: assembly language (7 marks)
Memory holds 26 at address 150, 86 at address 300 and 150 at address 420. The program stores location 300 as A and location 420 as B, adds the value at the address held in B to A, and stores the result in Answer. The scheme’s answer:
LDD 300
STO A
LDD 420
STO B
LDI B
ADD A
STO Answer
The marks (8 points, maximum 7) were for LDD 300; correct use of STO at least once; LDD 420; LDI B; ADD A; labelling the three locations A:, B: and Answer:; the right contents in A and B (86 and 150); and the right value in Answer, 112. LDI B looks at address 150, the address stored in B, and loads 26; adding A’s 86 gives 112.
Question 12: stacks (9 marks)
The stack holds up to 100 strings in StackArray[0:99], with Top starting at −1.
- Completing Push() (4 marks, one per line): the header PROCEDURE Push(NewData : STRING); Top ← Top + 1; StackArray[Top] ← NewData; and an OUTPUT message saying the stack is full and the data cannot be added.
- Using Push() (2 marks): an input into a variable, with or without a prompt (1), and a call to Push with that variable as the argument (1), for example INPUT MyData then CALL Push(MyData).
- Why recursion uses a stack (3 marks): any three of: a stack is last in, first out; each time the algorithm calls itself, data is pushed onto the stack; when it reaches the base case and starts to unwind, data is popped off in the reverse order it was pushed.
Where the marks are on 9618/32
| Topic | Questions | Marks |
|---|---|---|
| Data representation: records, enumerated types, floating-point | 1, 2 | 12 |
| Communication: protocols, BitTorrent, switching | 3, 4 | 10 |
| Boolean algebra and logic circuits | 6 | 9 |
| Stacks and recursion | 12 | 9 |
| Compilation and Reverse Polish Notation | 8 | 8 |
| Assembly language | 11 | 7 |
| Artificial intelligence | 9 | 6 |
| Operating systems | 5 | 5 |
| Encryption | 7 | 5 |
| Exceptions | 10 | 4 |
| Total | 75 |
- 29 marks have answers you can check exactly: the floating-point conversions, the logic question, the RPN conversion and evaluation, and the assembly code. Practise these until they are reliable.
- Writing pseudocode carried 12 marks: the declarations in Question 1 and the stack code in 12(a).
- The “describe” parts on BitTorrent, back propagation and recursion are point-marked lists. Learn the sequence of steps for each, because the points follow that sequence.
How to self-mark 9618/32 with the mark scheme
- Learn the abbreviations. A slash separates alternative words, // separates alternative answers, underlined words must appear, and “Max” caps a list.
- Mark the floating-point working separately from the answer. In 2(a) the exponent and the method are two marks even if the final value is wrong.
- Check your stack drawings stage by stage. In 8(c), each of the four stages is a mark, so one slip early does not cost every mark.
- Count your assembly mark points against all eight. The question is out of 7, so one miss can still leave full marks.
- Check the K-map cell order. BC runs 00, 01, 11, 10. A table written in binary order will put two columns in the wrong place.
- For the comparison questions in 4(b), check each difference names both types of switching.
Sit 9618/32 as a timed mock
The paper allows 90 minutes for 75 marks, about 1 minute 10 seconds per mark. A workable plan:
| Block | Marks | Time |
|---|---|---|
| Question 1 | 6 | 6 minutes |
| Question 2 | 6 | 8 minutes |
| Question 3 | 6 | 7 minutes |
| Question 4 | 4 | 5 minutes |
| Question 5 | 5 | 6 minutes |
| Question 6 | 9 | 11 minutes |
| Question 7 | 5 | 6 minutes |
| Question 8 | 8 | 10 minutes |
| Question 9 | 6 | 7 minutes |
| Question 10 | 4 | 4 minutes |
| Question 11 | 7 | 9 minutes |
| Question 12 | 9 | 9 minutes |
| Check calculations | – | 2 minutes |
| Total | 75 | 90 minutes |
There is no calculator, so write out the place values for each floating-point conversion and check your answer by converting it back.
9618/32 in other series
The May/June 2026 Paper 32 asked several of the same things: an enumerated type declared with TYPE … = (…), a floating-point conversion, TCP/IP protocols, a Karnaugh map with a simplified sum-of-products, how asymmetric keys are used, RPN converted to infix and evaluated on a stack, and deep learning. This paper had assembly language, a stack with recursion, BitTorrent and back propagation, while 2026 had Dijkstra’s algorithm, Big O, virtual machines and an OOP class.
Other October/November 2025 9618 papers
- 9618 Paper 12 (Theory Fundamentals)
- 9618 Paper 22 (Fundamental Problem-solving and Programming Skills)
- 9618 Paper 42 (Practical)
Practise and download
- Download 9618/32 and its mark scheme on the Learning Portal →
- All 9618 October/November 2025 papers: overview and marking patterns
- All 9618 May/June 2026 papers: overview and marking patterns
- Try a free A Level Computer Science quiz
Need help with a 9618 topic? Book a free trial lesson with an A Level Computer Science tutor →
Frequently asked questions
What topics were on 9618 Paper 32 October/November 2025? +
Twelve questions: a Car record and an enumerated type; floating-point conversion both ways; HTTP, IMAP and BitTorrent; circuit and packet switching; interrupts and process states; a logic circuit, K-map and sum-of-products; asymmetric encryption; compiler optimisation and Reverse Polish Notation; deep learning and back propagation; exceptions; assembly language with indirect addressing; and a stack with recursion.
How many marks is 9618/32 and how long is it? +
It is out of 75 marks and lasts 1 hour 30 minutes, with no calculator allowed. Questions 6 and 12 were the largest at 9 marks each, followed by the 8-mark compilation and RPN question.
What were the floating-point answers on 9618/32 Oct/Nov 2025? +
With a 10-bit mantissa and 6-bit exponent, 0111100101 001011 is 1940: the exponent is 11, so the point moves 11 places to give 11110010100. +26.6875 is 11010.1011 in binary, which normalises to mantissa 0110101011 and exponent 000101.
What did the RPN expression in 9618/32 Question 8(c) evaluate to? +
46. With a = 3, b = 16, c = 9 and d = 6, c ÷ a gives 3, b − d gives 10, multiplying gives 30, and adding b gives 46. One mark was given for each of four stages of the stack.
What was the assembly language answer in 9618/32 Question 11? +
LDD 300, STO A, LDD 420, STO B, LDI B, ADD A, STO Answer. A holds 86, B holds 150, and LDI B loads 26 from address 150, so Answer is 26 + 86 = 112. The question had 8 mark points for a maximum of 7.
Where can I download 9618/32 October/November 2025 and its mark scheme? +
Both are free to download and print on the Tutopiya Learning Portal, on the Cambridge AS & A Level Computer Science 9618 past papers page.
What is 9618_w25_qp_32? +
9618_w25_qp_32 is the file name of the question paper for Cambridge AS & A Level Computer Science 9618 Paper 32 (Paper 3 Advanced Theory, variant 2), October/November 2025. Its mark scheme is 9618_w25_ms_32, and the code printed on the cover is 9618/32/O/N/25. In these file names, w25 means the October/November 2025 series, qp means question paper and ms means mark scheme.
Ready to Excel in Your Studies?
Get personalised help from Tutopiya's expert tutors. Whether it's IGCSE, IB, A-Levels, or any other curriculum — we match you with the perfect tutor and your first session is free.
Book Your Free TrialWritten by
Mahira Kitchil
Connect on LinkedIn →Project Head, Tutopiya
Mahira Kitchil is a Project Head at Tutopiya, where she works with Cambridge IGCSE and Edexcel A-Level teachers in more than 20 countries on how exams are set and marked. She writes practical guides that help students find the right past papers and use the mark scheme the way examiners do, so every practice paper counts.
Related Articles
A Level Biology 9700 Oct/Nov 2025 Papers & Mark Schemes
Free 9700 Oct/Nov 2025 Paper 1 and Paper 3 with mark schemes: the topics tested, the practical tasks and how examiners awarded marks on each.
A Level Computer Science 9618 Oct/Nov 2025 Papers & Marking
Free 9618 Oct/Nov 2025 papers and mark schemes, plus a paper-by-paper breakdown of Papers 1 to 4 and how examiners gave marks for code and theory.
A Level Geography 9696 Oct/Nov 2025 Papers: Topics & Mark Scheme
Free 9696 Oct/Nov 2025 papers, inserts and mark schemes, plus a paper-by-paper breakdown of the data questions, options and essays and how they were levelled.
