A-LevelComputer ScienceProgrammingMay/June 2025Paper 3 Q134 Marks
The recursive procedure Delete() is defined as follows: PROCEDURE Delete(Index, Target) IF Numbers (Index) > 0 THEN IF Numbers[Index] >= Target THEN Numbers [Index] ← Numbers [Index + 1] ENDIF Index ← Index + 1 CALL Delete(Index, Target) ENDIF ENDPROCEDURE An array Numbers is used to store a sorted data set of non-zero positive integers. Unused cells contain zero. The contents of the array at the start of the algorithm are: Numbers [1] | [2] | [3] | [4] | [5] | [6] | [7] | [8] | [9] | [10] 2 | 3 | 7 | 11 | 15 | 17 | 19 | 23 | 0 | 0 Complete the trace table for the algorithm for the procedure call: CALL Delete(1, 15) Numbers Index | Target | [1] | [2] | [3] | [4] | [5] | [6] | [7] | [8] | [9] | [10] | | 2 | 3 | 7 | 11 | 15 | 17 | 19 | 23 | 0 | 0
📋 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