Assessment Overview & Difficulty Verdict

The May/June 2026 series for Cambridge International AS Level Computer Science (9618) components 13 and 23 offers a comprehensive, highly standard syllabus coverage totalling 150 marks across 3 hours and 30 minutes. The paper sits at a moderate difficulty rating of 3.2 / 5.0 (3 Stars). It balances straightforward recall questions with rigorous algorithmic tracing, detailed linked-list maintenance procedures, and complex SQL data definitions.

Where the Marks Are Distributed

Marks are concentrated in core practical and application areas:

  • Programming & Algorithm Design (Paper 2): Accounting for 48 marks combined, key domains include complex 2D array and record handling in FindBin() (7 marks), file search subroutines (7 marks), and structured trace execution for common divisor algorithms (9 marks).
  • Abstract Data Types: A robust 13-mark question series on linked lists spanning array pointer representation, node deletion corner cases, and textual explanation of node insertion.
  • Relational Databases (Paper 1): A prominent 17-mark block assessing 3NF database design with primary/foreign keys, identification of syntax errors in DDL scripts, and multi-table aggregate SQL query formulation with GROUP BY and ORDER BY.
  • Hardware and Data Representation: 31 marks dedicated to binary additions, two's complement bounds, sound/bitmap encoding calculations, ROM technologies, and microphone transducers.

Examiner Pitfalls & Critical Traps

  • String and Array Bounds in Pseudocode: In string slicing (such as MID and RIGHT in Q5a), candidates frequently miscalculate string indices and lengths by forgetting 1-based indexing conventions.
  • Trace Table Execution: In Question 7, precise step-by-step updating of the Index and Match variables during iterative factor search is essential. Prematurely skipping lines leads to lost method marks.
  • SQL DDL Syntax: Common syntax slips in Question 4(c) include omitting table targets in foreign key constraints (e.g. REFERENCES DEPARTMENT(DepartmentID)) and using incorrect nullability constraints (NONULL instead of NOT NULL).

Revision Strategy & High-Yield Areas

Prioritise mastering pseudocode algorithm writing for nested arrays and user-defined records. Ensure complete familiarity with standard ADT manipulations without relying on high-level language built-ins, and practice exact SQL aggregation queries with inner joins.