Cambridge 9618 · Original practice

A Level Computer Science Model Papers

Practice sets for all four components: AS theory, AS problem-solving, advanced theory and practical programming. Questions are original revision exercises, not official Cambridge papers or predictions.

Papers 1–4Indicative answer guidePrint-friendly
Use correctly: For the 2027–2029 Cambridge 9618 syllabus, AS candidates take Papers 1 and 2; full A Level candidates take all four papers. Paper 4 must be practised on a computer in one of the permitted console languages. The questions below are compact practice sets, not a complete 75-mark official-format paper. Follow the official syllabus and current specimen materials for exact requirements.

Paper 1 · Theory Fundamentals

AS topics 1–8 · 1 hour 30 minutes · 75 marks

Q1. Number representation

(a) Convert denary 45 to 8-bit binary. (3) (b) Explain one difference between ASCII and Unicode. (2) (c) A bitmap is 800 × 600 pixels at 24-bit colour depth. Calculate its uncompressed size in bytes, ignoring the header. Show working. (4)

Indicative answer / marking points

45 = 00101101. ASCII has a limited character set; Unicode supports many more characters/languages. Size = 800 × 600 × 24 ÷ 8 = 1,440,000 bytes.

Q2. Communication

Explain two differences between packet switching and circuit switching. Give one reason DNS is needed. (6)

Indicative answer / marking points

Packet switching splits data into packets which may share links and take different routes; circuit switching reserves a path for a session. DNS resolves domain names to IP addresses.

Q3. Hardware and CPU

Describe the roles of the ALU, control unit and program counter. (6)

Indicative answer / marking points

ALU performs arithmetic/logic; control unit decodes instructions and coordinates signals; program counter holds address of next instruction.

Q4. Security and integrity

A school stores student records. Recommend three controls to reduce unauthorised access and explain how each helps. (6)

Indicative answer / marking points

Examples: unique accounts/strong authentication, role-based permissions, encryption, updates, backups, physical controls. Explain specific threats each control addresses.

Q5. Databases and ethics

Explain the purpose of a primary key and a foreign key. State one ethical concern when collecting student data and one way to reduce it. (6)

Indicative answer / marking points

Primary key uniquely identifies a record; foreign key links a record to a related table. Privacy/consent or excessive collection; collect only necessary data, restrict access and explain use.

Paper 2 · Fundamental Problem-solving and Programming Skills

AS topics 9–12 · 2 hours · 75 marks

Q1. Computational thinking

A library needs a program to track borrowed books. Describe decomposition and abstraction for this problem. Give two items of test data for a due-date field. (6)

Indicative answer / marking points

Decompose into member, book, loan, return and overdue tasks; abstract only relevant details. Test valid date and invalid/impossible date, with clear expected behaviour.

Q2. Trace a loop

Consider pseudocode: Total ← 0; FOR Count ← 1 TO 4; Total ← Total + Count; NEXT Count; OUTPUT Total. State the output and explain the final values of Count and Total. (5)

Indicative answer / marking points

Output Total is 10 (1+2+3+4). Total accumulates each Count. The loop control variable after termination depends on the exact pseudocode convention taught; state the convention given in the question rather than assuming an undocumented value.

Q3. Design an algorithm

Write pseudocode to input 20 scores, reject scores outside 0 to 100, count scores at least 50, and output the count. (10)

Indicative answer / marking points

Use a FOR loop for 20 inputs. For each score, repeat input while score < 0 OR score > 100, then IF score >= 50 increment PassCount. Output PassCount. Initialise counter to 0.

Q4. Data structures

Explain why a record may be suitable for a student, and why an array may be suitable for storing 30 student marks. (5)

Indicative answer / marking points

A record groups related fields such as ID, name and date of birth. An array stores many same-purpose values under one name and permits indexed access.

Q5. Testing and development

Distinguish validation from verification. Describe normal, boundary and erroneous test data for an age field accepting 11–18. (6)

Indicative answer / marking points

Validation checks rules; verification checks accurate copying/entry. Normal e.g. 15; boundary 11 and 18; erroneous e.g. 10, 19 or text if only integer ages are allowed.

Paper 3 · Advanced Theory

A Level topics 13–20 · 1 hour 30 minutes · 75 marks

Q1. Floating point and files

Explain the purpose of the exponent and significand in floating-point representation. Compare sequential and direct file access. (7)

Indicative answer / marking points

Significand stores significant digits; exponent scales magnitude. Sequential access processes records in order; direct access can locate a record using an address/key without reading all earlier records.

Q2. Networks and security

Explain one benefit and one limitation of packet switching. Describe how a digital certificate supports secure communication. (7)

Indicative answer / marking points

Shared links and alternate routes improve utilisation/resilience; delay/order variability may occur. A trusted CA signs a certificate linking identity to a public key; clients validate trust and certificate details.

Q3. Virtual machines and processors

Describe two benefits of virtual machines and explain why adding CPU cores does not always make a program proportionally faster. (7)

Indicative answer / marking points

Isolation and consolidation are benefits. Some work is sequential; synchronisation and communication create overhead, so only parallelisable parts gain speed.

Q4. Artificial intelligence

A hospital considers an AI tool to help prioritise cases. Discuss two benefits and three risks, and recommend safeguards. (8)

Indicative answer / marking points

Benefits may include faster triage and consistent pattern detection. Risks include biased data, privacy exposure, poor generalisation and opaque decisions. Safeguards: representative testing, privacy controls, human review, audit and monitoring.

Q5. Boolean algebra and recursion

State De Morgan’s law for NOT(A OR B). Explain why a recursive algorithm needs a base case. (5)

Indicative answer / marking points

NOT(A OR B) = NOT A AND NOT B. The base case terminates recursion; each recursive call must move toward it.

Paper 4 · Practical programming practice

A Level topics 19–20 · 2 hours 30 minutes · 75 marks

Task 1. Data processing

Create a program that reads records from a text file, validates numeric scores from 0 to 100, counts valid records, calculates the mean of valid scores and reports rejected records. Include suitable error handling. (25)

Indicative answer / marking points

Use safe file opening/closing, line-by-line parsing, numeric conversion with exception handling, range checks, counters and a guarded mean calculation when no valid scores exist.

Task 2. Algorithm and recursion

Write a recursive function to calculate the sum of integers from 1 to n for n ≥ 0. Include a base case and demonstrate the result for n = 4. (15)

Indicative answer / marking points

Base case n = 0 returns 0; otherwise return n + Sum(n−1). Sum(4)=4+3+2+1+0=10. Validate negative input.

Task 3. Paradigm and testing

Design a small program using a suitable modular or object-oriented approach to store and search a collection of items. Provide test cases and evidence of expected/actual results. (20)

Indicative answer / marking points

Separate data, input, search and output responsibilities. If using classes, define state and methods clearly. Test empty collection, one item, match, no match, duplicate key and invalid input.

Task 4. Code quality

Explain two benefits of exception handling and two benefits of modular programming. (15)

Indicative answer / marking points

Exception handling allows safe responses to expected runtime failures and clearer user feedback. Modules improve readability, testing, reuse and maintenance.

Exam practice routine

Attempt first

Hide the answer guide and complete each question under timed conditions. Write workings, not just final answers.

Mark honestly

Compare your answer with the indicative points. Award marks only for correct, relevant explanations and working.

Improve the weak areas

Record mistakes by topic and redo similar problems after reviewing the concept notes.

Practise Paper 4 in code

Write, run and test programs in your chosen permitted language. A written outline alone is not practical preparation.

Review notesPractise MCQsOfficial 2027–2029 syllabus ↗