These Standard Level Computer Science topics consistently produce the lowest scores. Prioritise these in your revision.
!
Algorithm construction in pseudocode — loops, arrays, boundary handling
'Students faced difficulty in those questions requiring algorithms to be written in pseudocode, with the students not fully following the rules and concepts of programming.' The highest-discriminating skill on SL Paper 1.
Affects: Paper 1
!
Sorting algorithms — bubble sort vs selection sort implementation
'Some had combined the code for bubble sort and selection sort.' Students must be able to write both algorithms correctly from memory and know when to use each.
Affects: Paper 1
!
Primary memory types — RAM, ROM, cache (NOT HDD/SSD)
'Some students did not identify the primary memory types correctly. Their responses included comparisons between hard disk drive, solid state drive, cache.' Primary memory = RAM + ROM + cache only.
Affects: Paper 1
!
Database normalisation — understanding 1NF, 2NF, 3NF
'Normalization was challenging with most students showing only a partial understanding.' Students must identify primary and foreign keys as part of the normalisation process.
Affects: Paper 2
!
Collections vs arrays — using the correct access methods
'Few students had mixed up the operations associated with a collection and an array. They had used collection methods for array / index for collection.' Arrays use index; collections use hasNext()/getNext().
Affects: Paper 1
!
Usability vs accessibility — understanding the difference
'There were some responses which listed accessibility problems as usability issues. Students are recommended to fully understand the difference between usability and accessibility.' Usability = ease of use; accessibility = access for users with disabilities.
Affects: Paper 1
!
Encryption — how it works and what it protects against
'Responses included vague references to encryption, often confusing with other security methods.' Students must understand that encrypted text can be intercepted and read but NOT understood without the decryption key.
Affects: Paper 1
!
Trace tables — correct initialisation and tracking of all variables
'Candidates are reminded to make sure that any variables that are initialised in the algorithm also need to be initialised in the trace table, and that inappropriate entries such as dashes should not appear mid-table.' A common source of lost marks.
Affects: Paper 1