Refer to the insert for the list of pseudocode functions and operators. A program uses many complex algorithms. One algorithm is repeated in several places. The code for the algorithm is the same wherever it is used, but the calculations within the algorithm may operate on different data. The result of each calculation is used by the code that follows it. It is decided to modify the program and implement the algorithm as a separate module.

Mark scheme

Marking points from the official mark scheme (May/June 2024). The mark or mark type is shown in brackets.

1. [1] (a)(i) The code can be called when needed
2. [1] (a)(i) Any subsequent change to the algorithm / calculation needs to be made once only // Easier to manage / maintain (the program)
3. [1] (a)(i) Less code / no code duplication
4. [1] (a)(i) The algorithm / code / calculation can be designed / coded / tested once
5. [1] (a)(ii) Create a module / function / procedure / subroutine using the (old) code / algorithm
6. [1] (a)(ii) Replace the old code / algorithm wherever it appears with a call to the module / function / procedure / subroutine
7. [1] (a)(ii) Pass the data as parameter(s) // Use of global variable(s)
8. [1] (a)(ii) Return the result (of the calculation) // Assign result to global variable(s) / BYREF parameter(s)
9. [1] (a)(ii) Create local variables as needed (to perform the calculation)
10. [1] (b) MID ("Random", 2, 3) // Evaluates to "and"
11. [1] (b) 5 + DAY (10/11/2023) // Evaluates to 15
12. [1] (b) IS_NUM("45000") // Evaluates to TRUE
13. [1] (b) (20 MOD 3) + 1 // Evaluates to 3