February/March 2026 Paper 22

2026 · 9 questions · 21 parts · 75 marks

0/75 marks
0Correct0Partial0Wrong21Unattempted
Filters0 active

Questions

Select a part to jump to its question

Finish set
Q1
1
–/1 mk
Q2
2(a)2(a)(i)2(a)(ii)2(b)2(c)
–/11 mks
Q3
3
–/6 mks
Q4
4
–/1 mk
Q5
5(a)5(b)5(c)
–/11 mks
Q6
6(a)6(b)6(c)
–/11 mks
Q7
7(a)7(b)
–/8 mks
Q8
8(a)8(b)8(c)8(d)
–/11 mks
Q9
9
–/15 mks
Context for question 5
This pseudocode algorithm is intended to sort 200 names in ascending order, using a bubble sort. The last names and first names are stored in separate columns of a two‑dimensional (2D) array. The last names are stored in column 1 of the array.
pseudocode
// The array Names[] has already been declared as// ARRAY[1:200, 1:2] OF STRING and it is already populatedDECLARE Row : STRINGDECLARE Temp1 : STRINGDECLARE Temp2 : STRINGDECLARE Swap : BOOLEANSwap ← FALSEWHILE NOT Swap DO    Swap ← FALSE    FOR Row ← 2 TO 199        IF Names[Row, 1] > Names[Row + 1, 1]          THEN            Temp1 ← Names[Row, 1]            Temp2 ← Names[Row, 2]            Names[Row, 1] ← Names[Row + 1, 1]            Names[Row, 1] ← Names[Row + 1, 2]            Names[Row + 1, 1] ← Temp1            Names[Row + 1, 2] ← Temp2            Swap ← FALSE        ENDIF    NEXT ColumnENDWHILE
5(a)Sorting AlgorithmsMedium5 marks
Identify the line numbers of five errors in the pseudocode and suggest corrections.

Answer

0 words
5(b)Two Dimensional ArraysMedium4 marks
Write the pseudocode for an algorithm, using nested iteration, to output the contents of Names[].

Answer

0 words
5(c)Sorting AlgorithmsMedium2 marks
Describe a possible problem with the algorithm that could mean the names are not sorted accurately.

Answer

0 words