Cambridge IAL · Analysis & Prediction

2023 Cambridge IAL Computer Science (9618) Past Paper Analysis

A comprehensive analysis of the May/June 2023 exam series (Papers 13, 23, 33, and 43), highlighting key focus areas such as object-oriented inheritance, complex file operations, stack/queue manipulation, floating-point precision limitations, and asymmetric key cryptography.

Updated: 12 Jun 2026

Analysis Sample paper

Difficulty 3.5/5

Total marks

300

Duration

450 mins

Most tested

Further Programming & Problem-solving

Paper breakdown

Paper 13 Core Fundamentals: 75 marks · 90 minsPaper 23 Fundamental Problem-solving & Skills: 75 marks · 120 minsPaper 33 Advanced Theory: 75 marks · 90 minsPaper 43 Practical Programming: 75 marks · 150 mins

Top chapters

Further Programming (A Level content) · 45 marksProgramming (AS Level content) · 35 marksAlgorithm Design and Problem-solving (AS Level content) · 35 marksComputational thinking and Problem-solving (A Level content) · 18 marksDatabases (AS Level content) · 18 marks

May/June 2023 Series Analysis: A Rigorous Evaluation

The May/June 2023 Computer Science (9618) series presented a robust test of theoretical comprehension and practical programming. Across all four papers, examiners elevated the demand for structural accuracy in algorithms and technical precision in theoretical explanations. Paper 13 set a strong conceptual baseline, while Paper 23 and Paper 43 heavily penalized loose syntax in pseudocode and practical implementations.

Where the Marks are Found

The core weight of this assessment resides in modular algorithm design. The high-scoring practical tasks in Paper 43 required flawless implementation of object-oriented concepts, specifically private attribute declarations, constructor instantiation, and inheritance overrides (e.g., the Vehicle and Helicopter classes). In Paper 23, file manipulation routines and string parsing (such as substring extraction) accounted for nearly a quarter of the available marks, demanding that candidates write clean, compilable logic.

Examiner Pitfalls & Strategy

A recurring area of concern noted by the Principal Examiner was the improper handling of modular functions. Many candidates incorrectly used the CALL keyword with functions or substituted OUTPUT where a RETURN was required. Additionally, file-handling operations frequently suffered because candidates failed to secure file closure inside exception blocks, or missed enclosing literal filenames in double quotes. In theory sections, vague assertions such as 'upgrading the CPU' or comparing circuit switching directly with packet switching when not prompted resulted in immediate loss of marks.

Predictive Outlook

Analyzing prior series suggests that upcoming exams will likely double down on Assembly Language and low-level processor instruction sets, which were underrepresented in this iteration. Candidates should also expect a shift back toward binary search tree traversals and graph algorithms in Paper 3, as stacks and circular queues took center stage this year. Regular practice with the official CIE Pseudocode Guide remains the single most effective preparation strategy.

Charts

Marks by chapter

See where the marks were concentrated so revision time goes to the highest-value topics.

Question type mix

Compare the mark share of each paper section and question type.

Theory / Description110 marks · 48 questions
Pseudocode / Programming140 marks · 32 questions
Working / Calculations50 marks · 18 questions

Mark accessibility

Estimate which marks were basic, mid-level, or high-difficulty.

73%within easy or medium reach

130

easy: 90 marksmedium: 130 markshard: 80 marks

Difficulty trend

Compare difficulty across recent years.

Command word frequency

Spot common command words so answers match the expected response style.

Skill weighting

Shows the skill mix this paper tested most heavily.

Study ROI

Bigger bubbles recur more often; higher bubbles carry more marks, helping you rank revision priorities.

Further Programming (Classes, Inheritance, OOP)

45 marks · Difficulty 4.2 · recurrence 5%

AS Programming & Pseudocode (Strings, Loops)

35 marks · Difficulty 3.2 · recurrence 5%

Databases & Normalisation (3NF Tables)

18 marks · Difficulty 3 · recurrence 4%

Data Structures (Stacks & Queues)

13 marks · Difficulty 3.5 · recurrence 5%

Computational thinking (Search & Hash)

18 marks · Difficulty 4 · recurrence 4%

Time vs marks

Compare marks with suggested time allocation to plan exam pacing.

marksmins

Next-year prediction

Topics worth watching next year, with the reason shown directly below each bar.

Assembly Language and Instruction Sets90%

Underrepresented in the current theory series; processor direct and indexed addressing modes are historically consistent core elements.

Data Structures - Binary Trees & Traversal85%

A Level Paper 3 often alternates between queue/stack representations and binary search tree insertion/traversal algorithms.

Database DDL Commands (SQL CREATE TABLE)80%

A critical AS component requiring exact SQL notation, which often sees low candidate performance.

Cumulative marks ladder

The line is your running mark total question by question; dashed lines are the estimated grade cut-offs. See which question the line crosses your target grade at, so you know how far you must answer cleanly and which questions decide a band.

Topic-year heatmap

Compare topic weight by year to spot recurring and returning areas.

Jun 2023 (V1)

Jun 2023 (V2)

Jun 2023 (V3)

Further Programming

Programming (AS)

Computational thinking and Problem-solving

Information representation

Software Development

Algorithm Design and Problem-solving

Data Types and Structures

Databases

Processor Fundamentals

Artificial Intelligence (AI)

Examiner insights

Official report

Common pitfalls

Misusing the CALL keyword before user-defined function calls instead of assigning directly to variables.
Confusing local variable identifiers with reserved keyword data types like Char.
Ignoring case-sensitivity instructions in string comparisons.
Failing to write quote marks around literal filenames in file open statements.
Leaving out critical parameters or return statements from modular function definitions.

Misconceptions

Believing that a compiler is chosen during program design/coding rather than on completion for production.
Assuming that a control bus carries data or instructions instead of control signals.
Assuming that the smallest value of an 8-bit two's complement integer is -127 instead of -128.
Thinking that double colons (::) are not required in condensed IPv6 addressing formats.

Where marks are lost

Losing marks on Paper 43 file handling by neglecting to handle exceptions or failing to close opened files inside the try-except blocks.
Failing to perform proper validation loops when taking user inputs, leading to out-of-bounds array operations.
Failing to implement recursive unwinding correctly in trace tables, resulting in lost arithmetic calculation marks.

Estimated grade cut-off

Updated: 12 Jun 2026

Source: Cambridge International grade thresholds (official)

Level	Mark	Percentage
A*	231/300	77%
A	201/300	67%
B	171/300	57%
C	139/300	46%
D	107/300	36%
E	75/300	25%

Official grade boundaries published by Cambridge International grade thresholds (official).

Know what the examiners want — now go get those marks

Thinka is an AI practice app used by 100,000+ DSE students to drill questions and get instant feedback on every answer. You already know the high-frequency topics and where marks are lost — now practice those specifically on Thinka and turn this analysis into actual marks.

Start Practising Free See pricing

Know what's tested? Drill those topics on Thinka — AI questions, instant marking.

Start Practising Free