This pseudocode represents an algorithm. An input of -1 will terminate the algorithm. DECLARE Count : INTEGER DECLARE Answer : INTEGER DECLARE Value : INTEGER REPEAT INPUT Value IF Value <> -1 THEN Answer ← Value FOR Count ← Value - 1 TO 1 STEP -1 Answer ← Answer * Count NEXT Count OUTPUT Answer ENDIF UNTIL Value = -1

Mark scheme

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

1. [1] Correct Value column
2. [1] Correct Count column
3. [1] Correct Answer column (down to first OUTPUT (120)) – Shaded grey
4. [1] Correct Answer column (remaining rows)
5. [1] Correct OUTPUT column
6. [1] It multiplies the input number by one less than itself repeatedly, until the value is 1
7. [1] It calculates the number of permutations of all the numbers up to the input value
8. [1] The program would accept the value and enter the FOR loop
9. [1] Count would keep reducing by 1 and would never reach 1, as it would already be less than 1
10. [1] There would be an endless loop