Overall Difficulty Verdict
The 9618 October/November 2025 examination series is marked at a moderate-to-high difficulty level (3.8 out of 5). The theoretical portions of Paper 1 and Paper 3 presented standard theoretical challenges with a few technical hurdles, such as Karnaugh map simplification and assembly language variable manipulation. In contrast, Paper 2 and Paper 4 pushed candidates on execution detail. Specifically, candidates were expected to write highly efficient search-and-insert algorithms on dynamic arrays, binary trees, and record types. Neglecting early-exit conditions in search loops or writing sloppy OOP syntax with public instead of private attributes was severely penalized.
Where the Marks Are Won and Lost
In the theory components, high-scoring candidates secured marks on mathematical computations (such as binary floating-point conversions, logic gate expressions, and Reverse Polish Notation evaluations). However, substantial marks were dropped on detailed explanations of networking protocols (such as BitTorrent swarm mechanics) and deep learning processes (such as the calculus of back propagation of errors). In the programming papers, marks were heavily concentrated in correct file handling structure (with robust exception handlers) and object-oriented class definitions. A significant differentiator was the ability to implement a binary tree search-and-insert algorithm (AddNode) in Paper 4 without logic errors.
Examiner Pitfalls and Conceptual Misconceptions
- Linear search redundancy: In Paper 2, many candidates wrote loops that checked all 7,000 array elements even after locating the target index, demonstrating a lack of efficiency awareness.
- Private vs. Public attributes: In Paper 4, candidates repeatedly failed to mark class attributes as private, which is an automatic loss of foundational OOP design marks.
- Indirect vs. Indexed Addressing: Tracing assembly operations (LDI vs. LDX) continues to trip up candidates who fail to distinguish between using an address to find a second address versus using an offset from an index register.
Preparation and Strategy Recommendations
To excel in future sessions, candidates must balance conceptual review with active, timed coding exercises. For Paper 2 and Paper 4, practice writing data structures (specifically stacks, queues, 2D arrays, and binary trees) from scratch in both pseudocode and your chosen high-level language (Python, Java, or VB). Pay special attention to search boundary parameters and recursion termination states. For the theoretical papers, construct concise flashcards for protocol layers, cryptography mechanisms, and hardware characteristics, ensuring definitions are stated in exact examiner-approved terminology.