The given algorithm is a simple bubble sort that arranges a set of scores stored in a one-dimensional array into descending order, and orders the corresponding students' names stored into a two-dimensional array in the same order as the scores. All the arrays are indexed from 1. The contents of both arrays after sorting are shown. Score 1 98 2 97 ... 248 5 249 3 Name 1 Smithfield Tom 2 Johnson Jane ... 248 Peters Jade 249 Allen John YearSize ← 249 Flag ← TRUE WHILE Flag = TRUE Flag ← FALSE FOR Student ← 1 TO YearSize - 1 IF Score [Student] < Score [Student + 1) THEN Temp1 ← Score[Student] Temp2 ← Name [Student,1] Temp3 ← Name [Student,2] Score [Student] ← Score [Student + 1] Name [Student,1] ← Name [Student + 1,1] Name [Student,2] ← Name [Student + 1,2] Score [Student + 1] ← Temp1 Name [Student + 1,1] ← Temp2 Name [Student + 1,2] ← Temp3 Flag ← TRUE ENDIF NEXT Student ENDWHILE
✓ Correct Answer
The correct answer is —. This question tests the candidate's understanding of algorithms within the Computer Sciencesyllabus. The examiner's mark scheme requires...
📋 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...
Unlock the Examiner's Answer
Sign up for free to reveal the correct answer, the official mark scheme breakdown, and the examiner trap analysis for this question.
Sign Up Free to Unlock →Join thousands of Cambridge students already using Oracle Prep