Exam Difficulty Verdict

The May/June 2025 series of 9618 Computer Science presented a balanced but challenging assessment. While Paper 11 remained highly accessible with standard database normalization, security encryption, and basic assembly trace tables, Paper 21 raised the bar significantly. The practical programming paper demanded rigorous logical precision, particularly in the 2D array bubble sort and sequential text file manipulation, making the overall series a solid 3.4 out of 5 in terms of difficulty.

Key Areas for Earning Marks

In Paper 1, substantial marks were concentrated in Databases (13 marks) and Communication (13 marks). Candidates who mastered the mechanics of INNER JOIN and GROUP BY clauses in SQL, alongside the 5-step process of digital signature verification, found themselves with a strong foundation. In Paper 2, the bulk of the marks was dominated by Programming (38 marks), specifically testing structured array manipulation, file writing, and validation test plans.

Common Pitfalls & Examiner Insights

Examiners highlighted several critical areas where students threw away marks:

  • File Mode Mismanagement: In Paper 2, Q7(b), candidates frequently forgot to close the text file after reading the existing lines before attempting to reopen it in APPEND mode. Doing so creates resource locks or runtime errors.
  • Partial Swapping in 2D Arrays: In the 2D array bubble sort (Q6(b)), a classic mistake was only swapping the speed values in column 1 while leaving the corresponding sensor IDs in column 2 unchanged, which completely corrupted the record association.
  • SQL Aggregate Grouping: Failing to include all non-aggregated SELECT fields inside the GROUP BY statement led to syntax errors in SQL.

Preparation Strategy & Future Outlook

To succeed in future sessions, students must shift from memorizing basic templates to writing adaptable code. Practice sorting multi-dimensional arrays where elements are linked. For theory, create active-recall cards for hardware processes (like magnetic disks) and security pipelines (digital signature hashing and encryption). We predict that future papers will continue to test Acyclic Graphs or Binary Search variants which were less prominent in this series, so prepare those thoroughly.