These Higher Level Computer Science topics consistently produce the lowest scores. Prioritise these in your revision.
!
Algorithm construction in pseudocode — loops, arrays, boundary handling
'There were very few attempts at pseudocode questions indicating that the students were not well prepared.' This is the highest-discriminating skill on Paper 1 — strong candidates score full marks, weak candidates score zero.
Affects: Paper 1
!
Linked lists and binary search trees — pointer manipulation, recursion, traversal
'Some HL candidates achieving hardly any marks on the linked list question.' Recursive algorithms on BSTs proved challenging. Students must use the methods provided in class definitions, not invent their own.
Affects: Paper 1, Paper 2
!
Database normalisation — 1NF, 2NF, 3NF with primary and foreign keys
'Normalization was challenging, with most students showing only a partial understanding. Too many students lost marks by not identifying primary and foreign keys as part of the process.'
Affects: Paper 2
!
SQL queries — JOIN conditions, aggregate functions (COUNT, SUM), WHERE clauses
'Most students were able to identify the tables required for the query but failed to describe an appropriate JOIN condition. Majority did not include the filtering condition.'
Affects: Paper 2
!
Paper 3 case study — inadequate research beyond the provided material
'Most candidates did not adequately prepare for the case study, and some seemed to have done little research.' Students who only use the case study cannot access top marks on the 12-mark question.
Affects: Paper 3
!
String manipulation and array processing in pseudocode
'The use of the string manipulation functions was misunderstood by most students, the use of flags or loops were rarely correct.' Substring, concatenation, and character extraction functions require practice.
Affects: Paper 1
!
Recursion — understanding and implementing recursive algorithms
'The Binary Search is a standard, recursive algorithm that candidates should be able to reproduce. It is clear that recursion in general and the Binary Search in particular remain challenging for HL candidates.'
Affects: Paper 1, Paper 2
!
Cloud computing models — deployment vs delivery models (PaaS/SaaS/IaaS)
'Many candidates were under the misapprehension that PaaS, IaaS, and SaaS were cloud deployment models when the case study clearly describes them as cloud delivery models.' Students must distinguish between deployment (public/private/hybrid) and delivery models.
Affects: Paper 3