Difficulty Verdict
This exam carries a medium-to-hard overall difficulty. Paper 1 requires precise technical vocabulary, and Paper 2 demands excellent syntax familiarity and rigorous debugging logic under timed conditions. Rather than merely writing short scripts, candidates have to actively refactor existing structures, debug turtle drawings, and handle multi-dimensional linear searches.
Where the Marks Are
Marks are heavily concentrated in practical application. In Paper 1, multi-step trace tables, flowchart logical mapping, and complex calculations (such as image file sizes in Mebibytes) carry significant weight. In Paper 2, Question 5 (File I/O) and Question 6 (2D List Search) contain the highest concentration of marks, prioritizing robust solution designs and adherence to the Program Language Subset (PLS).
Examiner Pitfalls
- Vague Network Explanations: Examiners consistently penalize simple descriptions like "LAN is smaller than WAN." Accurate descriptions must reference geographic ownership or third-party infrastructure.
- Object Hierarchy in Code: In Paper 2's Turtle graphics question, a frequent source of lost marks was using the library default turtle.method() instead of referencing the instantiated variable theTurtle.method().
- Math Unit Conversions: For image resolution calculations, writing base-10 metrics (1000) instead of binary prefix values (1024) is a common mistake.
Preparation Strategy
To maximize scores, students must master flowchart conventions (using correct process, decision, and input/output terminators with explicit branch labels) and trace table step executions. For Paper 2, focus on nested structures (such as a 2D array word table) and file manipulation methods. Emphasize defensive programming techniques to ensure algorithms exit cleanly when conditions are met.