Skip to main content
Edexcel IGCSEComputer ScienceGeneral Applications7 Marks

A developer is writing an algorithm to find the largest number in a list of 10 positive integers.

  1. (a)Identify a suitable data structure to store the 10 positive integers.[1]
  2. (b)Write pseudocode for an algorithm that takes a list of 10 positive integers as input and outputs the largest number found in the list.[6]

Mark scheme

Marking points from the official mark scheme. The mark or mark type is shown in brackets.

  1. **(a)**
  2. B1 for Array / List
  3. **(b)**
  4. C1 for initialising a variable for the largest number (e.g., to the first element or 0 if all positive)
  5. C1 for correctly looping through the list of 10 numbers (e.g. FOR loop 1 to 10 / WHILE loop)
  6. C1 for using a conditional statement (IF statement) inside the loop
  7. C1 for comparing current number with stored largest number
  8. C1 for updating the largest number variable if a larger number is found
  9. C1 for outputting the largest number after the loop terminates
  10. Accept variations in pseudocode syntax as long as the logic is clear and correct.
  11. Example Pseudocode:
  12. LIST_OF_NUMBERS = [num1, num2, ..., num10] // Assume input/populated list
  13. LARGEST = LIST_OF_NUMBERS[0] // Or 0 if guaranteed positive
  14. FOR EACH NUMBER IN LIST_OF_NUMBERS
  15. IF NUMBER > LARGEST THEN
  16. LARGEST = NUMBER
  17. END IF
  18. NEXT NUMBER
  19. OUTPUT LARGEST

Write your answer and get it marked

On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.

Sign up free →

About this question

Topic
General Applications, Edexcel IGCSE Computer Science. Structured question, 7 marks.

Questions and mark schemes are from past examination papers and remain the copyright of the exam board. How Oracle Prep builds its content

Related Computer Science questions

© 2026 Oracle Prep