This pseudocode algorithm is intended to store the names of up to 250 runners who finish a race. The names of the runners are stored in a one-dimensional (1D) array Runners[] and their time in seconds in a one-dimensional (1D) array Times[]. After the time for each runner has been entered into the array, the name of the runner and the time of the runner in minutes and seconds are displayed for verification.

Each runner takes 60 minutes or less to finish the race. A time of 60 minutes would be entered as 3600 seconds.

pseudocode

01DECLARE Runners : ARRAY[1:250] OF STRING02DECLARE Times : ARRAY[1:250] OF INTEGER03DECLARE Index : INTEGER04DECLARE RunName : STRING05DECLARE RunTime : STRING06DECLARE RunMins : INTEGER07DECLARE RunSecs : INTEGER08FOR Index ← 1 TO 25009    OUTPUT "Enter a runner’s name and then time (in seconds) "10    INPUT RunName11    OUTPUT RunTime12    RunMins ← DIV(RunTime, 60)13    RunSecs ← DIV(RunTime, 60)14    OUTPUT "Runner’s Name: ", RunName15    OUTPUT "Time: ", RunMins, " Minutes ", RunSecs, " Seconds"16    Runners[Index] ← RunMins17    Times[Index] ← RunTime18NEXT Index

4(a)Testing DebuggingMedium4 marks

Identify the line numbers of four errors in the pseudocode and suggest corrections.

Answer

0 words

Context for 4(b)

The algorithm is intended to work for positive finish times that are 3600 seconds or less, but any number of seconds can currently be input.

4(b)(i)Data Validation VerificationHard5 marks

Write the pseudocode statements to show how you would change the algorithm so that only times in the correct range could be input. The time taken to finish the race needs to be input again until valid data is input.

Clearly state where in the original algorithm your new statements would be placed.

Do not rewrite the whole algorithm.

Answer

0 words

4(b)(ii)Testing DebuggingEasy1 mark

Identify one other possible problem with the algorithm.

Answer

0 words