O-LevelComputer ScienceAlgorithm design and problem-solvingOct/Nov 2024Paper 2 Q48 Marks
This pseudocode algorithm is intended to sort a pre-populated one-dimensional (1D) array named ItemList into alphabetical order using a bubble sort. 01 DECLARE ItemList : ARRAY[1:100] OF STRING 02 DECLARE Counter : STRING 03 DECLARE Limit : INTEGER 04 DECLARE Pass : INTEGER 05 DECLARE Swapped : BOOLEAN 06 DECLARE Temp : STRING 07 Limit ← 100 08 Pass ← 1 09 Temp ← TRUE 10 WHILE Swapped = TRUE OR Pass <= Limit - 1 DO 11 Swapped ← FALSE 12 FOR Counter ← 1 TO Limit - Pass 13 IF ItemList[Counter] > ItemList[Counter + 1] 14 THEN 15 Temp ← ItemList[Counter] 16 ItemList[Counter] ← ItemList[Counter + 1] 17 ItemList[Counter + 1] ← Temp 18 Swapped ← TRUE 19 ENDCASE 20 Pass ← Pass + 1 21 NEXT Counter 22 ENDWHILE
📋 Examiner Report & Trap Analysis
Common mistake: 62% of candidates selected the distractor because they confused... The examiner specifically designed this question to test whether students can differentiate between... To secure full marks, candidates must demonstrate...
🎯 Mark Scheme Breakdown
Award 1 mark for identifying the correct principle. Award 1 mark for showing clear working. Common errors include failing to convert units and misreading the scale. The examiner report notes that only 34% of candidates achieved full marks on this question.
🔒
Unlock the Examiner's Analysis
Sign up for free to reveal the full examiner report, trap analysis, and mark scheme breakdown for this question.
Sign Up Free to Unlock →Join thousands of Cambridge students already using Oracle Prep