May 2024 IB Computer Science HL: A Comprehensive Exam Analysis

The May 2024 Higher Level exam papers presented a balanced but challenging test of both theoretical knowledge and practical logical skills. Paper 1 maintained its traditional split of straightforward Section A questions and intensive scenario-based Section B questions. Meanwhile, Paper 3 probed deeply into the vSLAM and rescue robotics case study, testing candidates' ability to synthesise technical algorithms with real-world ethical constraints.

Verdict on Difficulty

We rate this examination cycle at a 4 out of 5 stars for difficulty. While Section A of Paper 1 offered accessible marks in denary-binary conversion, peripheral definitions, and basic SaaS properties, Section B stepped up the rigor significantly. The 8-mark password validation algorithm (Q16c) required precise string slicing and robust loop logic, which tripped up students who rushed. Paper 3 also demanded deep technical accuracy; general responses on robot mechanics failed to gain marks where specific concepts like bundle adjustment, reprojection error, and perceptual aliasing were expected.

Where the Marks Were Won and Lost

In Paper 1, heavy-hitting chapters included Computational Thinking and Networks. Key areas where students lost marks include:

  • Linked List Deletion (Q15b): Many failed to detail the exact pointer manipulation steps, such as setting the 'next' pointer of the previous node to bypass the deleted node, and clearing the deleted node's memory.
  • Logic Diagrams (Q13b): Careless errors in NOT gates and inputs led to lost marks in otherwise straightforward boolean representations.
  • Algorithm Tracing (Q16b): Missing state changes in variables during string manipulation loops cost easy marks.
In Paper 3, the 12-mark essay (Q4) was the ultimate discriminator. High-achieving candidates structured their responses with clear headings, contrasting the operational benefits (such as reducing human risk) against heavy technical and financial costs.

Examiner Pitfalls to Avoid

Examiners highlighted several common traps from this session:

  • Verbatim Memorisation: In Paper 3, candidates who recycled phrases directly from the case study sheet (like "keeping track of its own location and orientation" for dead reckoning) received no marks. Definitions must show actual computational understanding.
  • Vague Explanations: Discussing "better internet" or "broken systems" in remote work/VPN scenarios without using technical terms like bandwidth, latency, or secure tunnels.
  • Loop Controls: Using prohibited command structures like break to terminate a loop, rather than using logical flags or proper loop conditions in pseudocode.

Future Outlook & Predictions

Based on the analysis of recent papers, several topics are currently under-tested and highly overdue for future sessions. Resource Management (particularly paging and scheduling) and Control Systems appeared only minimally in this paper and are expected to feature as full scenario-based questions in the next cycle. Students should prioritize writing out robust dynamic data structure algorithms (specifically binary tree traversals and stack/queue push/pop processes) to secure high-tier marks.