Difficulty Verdict

The October/November 2024 series for AS Level Computer Science (9618/13 and 9618/23) presented a medium-to-hard challenge. Paper 13 offered highly structured theoretical and logic elements alongside demanding SQL scripting and normalization tasks. Paper 23 tested students on advanced loop structures, array manipulations (specifically 1D linked list indices), file handling, and intricate functional logic (such as calculating the exact day of daylight saving adjustments).

Where the Marks are Concentrated

Marks were heavily concentrated in Programming (sNGwDh3zcdQ8AJIhYpB0) and Algorithm Design and Problem-solving (8PF8LXsmvNrWyRc3NyuO), which combined accounted for over 37% of the total available credit. In Paper 13, database queries and schema definitions also commanded a major share of marks (19 marks), proving that relational database design remains a foundational cornerstone of A-Level theory success.

Examiner Pitfalls & Lost Marks

  • Assembly Trace Precision: Many candidates failed the indirect addressing challenge (LDI 53) by loading the value at address 53 directly rather than fetching the secondary address stored at 53.
  • SQL Constraints & Schema Integrity: In the table definition task, candidates regularly missed matching foreign keys or omitted key constraints (such as NOT NULL and specific variable types).
  • Linked List Indexing Boundaries: In Paper 23, candidates struggled to correctly loop through 200 elements without introducing 1-off errors (e.g., executing 199 or 201 times) and mistakenly initialized null pointers to 0 despite indices starting at 1.
  • Pseudocode File Handling: Forgetting to explicitly call CLOSEFILE after executing file read loops continues to be a frequent reason for losing easy marks.

Preparation & Exam Strategy

Candidates must master the standard CAIE pseudocode syntax as detailed in the official guide. Avoid converting logic directly to Python/Java constructs (e.g., do not use print() or raw brackets instead of OUTPUT and explicit conditional blocks). For Paper 1, practicing hexadecimal conversions and negative sign-bit representation under timed conditions will build critical confidence. For Paper 2, emphasize dry-running modular algorithms with small test data tables before committing code to paper.

Future Predictions

Given the heavy rotation of standard 1D array operations, future assessments are highly likely to emphasize two-dimensional array search algorithms and file writing operations (such as appending records to existing files). Additionally, security protocols (symmetric/asymmetric encryption, SSL/TLS handshakes) and data representation arithmetic are overdue for a larger, more deep-dive question block in Paper 1.