O Level Computer Science 2210, topic 8.2

Arrays: past paper questions

25 Cambridge O Level Computer Science 2210 questions on Arrays (8.2) from 11 papers, 2023 to 2026. Open the paper or try a question free.

Practising builds a set from this topic, free with an account. One question opens straight away, with no account.

Questions
25
Papers
11
Years
2023 to 2026
Total marks
270
Average per question
10.8 marks
Largest question
15 marks

By type: Multiple choice 1 · Structured 22 · Essay 2

How hard the questions are

  • Recall1
  • Apply6
  • Analyse18
  • Not banded0

Derived from the command word Cambridge prints in each question, banded by a fixed table beside the syllabus's own definitions. A question printing no command word is unbanded: unknown, not middling.

Command words

  • explainAnalyse13 questions

    set out purposes or reasons / make the relationships between things clear / say why and/or how and support with relevant evidence

  • completeApply6 questions
  • suggestAnalyse6 questions

    apply knowledge and understanding to situations where there are a range of valid responses in order to make proposals / put forward considerations

  • describeApply4 questions

    state the points of a topic / give characteristics and main features

  • writeRecall3 questions
  • stateRecall2 questions

    express in clear terms

  • analyseAnalyse1 question
  • compareAnalyse1 question

    identify/comment on similarities and/or differences

  • drawApply1 question
  • findApply1 question

Where the questions come from

By year

  • 20264
  • 20258
  • 20246
  • 20237

By session

  • May/June17
  • Oct/Nov8

By paper

  • Paper 225

Questions on this topic

Showing 25 of 25, spread across the years. Open one to write your answer and have it marked.

  • Question 4May/June 2026, paper 21Structured4 marks

    The following pseudocode algorithm uses a bubble sort to sort the array Names[50] Complete the algorithm.

    Try this question
  • Question 2Oct/Nov 2025, paper 22Structured15 marks

    This pseudocode algorithm is intended to input a first name from a user and search for it in a two-dimensional (2D) array.

    Try this question
  • Question 4Oct/Nov 2024, paper 22Structured8 marks

    This pseudocode algorithm is intended to sort a pre-populated one-dimensional (1D) array named ItemList into alphabetical order using a bubble sort.

    Try this question
  • Question 3Oct/Nov 2023, paper 22Structured8 marksHas a diagram

    Four pseudocode statements and five pseudocode uses are shown. Draw one line to link each pseudocode statement to the most appropriate pseudocode use.

    Try this question
  • Question 12May/June 2026, paper 21Essay15 marks

    A weather monitoring station records the number of minutes of sunshine for each day of a month. The one‑dimensional (1D) array Sunshine[] is used to store the number of minutes of sunshine for each day. The index of the array represents the day.

    Try this question
  • Question 5Oct/Nov 2025, paper 22Structured13 marksHas a diagram

    This flowchart represents an algorithm.

    Try this question
  • Question 12Oct/Nov 2024, paper 22Structured15 marks

    A one-dimensional (1D) array Rooms[] contains the names of up to 20 rooms in a house. A two-dimensional (2D) array Dimensions[] is used to store the length, width and area of each room. The position of any room’s data is the same in both arrays.

    Try this question
  • Question 4Oct/Nov 2023, paper 22Structured9 marks

    An algorithm has been written in pseudocode to allow the names of 50 cities and their countries to be entered and stored in a two-dimensional (2D) array. The contents of the array are then output.

    Try this question
  • Question 5May/June 2026, paper 22Structured10 marksHas a diagram

    The purpose of this pseudocode algorithm is to find the name of a customer using an account ID, which contains letters and numbers.

    Try this question
  • Question 8Oct/Nov 2025, paper 22Structured15 marks

    A program is required to test the fairness of the random number generator. The one-dimensional (1D) array RandomNumber[] is used to store 100 000 random integers.

    Try this question
  • Question 10May/June 2024, paper 21Structured15 marks

    The one-dimensional (1D) array Clubs[] is used to store the names of 12 cricket clubs in a local sports league. The two-dimensional (2D) array Statistics[] is used to store, for each cricket club, the number of: • matches won • matches drawn • matches lost.

    Try this question
  • Question 11Oct/Nov 2023, paper 22Structured15 marks

    A wood flooring company stores the names of up to 100 customers in a one-dimensional (1D) array Customers[].

    Try this question
  • Question 10May/June 2026, paper 22Structured15 marks

    A program is required to record and analyse the daily rainfall in millimetres for one year. Assume a year has 365 days. The one-dimensional (1D) array Rainfall[] is used to store the daily rainfall measurements.

    Try this question
  • Question 3May/June 2025, paper 21Structured4 marks

    The following pseudocode algorithm uses a count-controlled loop to read in 10 names and store them in the array Names[] FOR Count ← 1 TO 10 OUTPUT "Please…

    Try this question
  • Question 7May/June 2024, paper 22Structured6 marks

    An algorithm has been written in pseudocode to find and display the maximum and minimum values in an array of 1000 positive numbers.

    Try this question
  • Question 2May/June 2023, paper 21Multiple choice1 mark

    Tick (✓) one box to show the name of the data structure used to store a collection of data of the same data type.

    Try this question
  • Question 11May/June 2025, paper 21Structured15 marks

    The one-dimensional (1D) array CompetitorName[] contains the names of 25 competitors in a tournament that includes five events. Another two-dimensional (2D) array CompetitorScore[] contains the points scored by each competitor in the five events.

    Try this question
  • Question 9May/June 2024, paper 22Structured7 marksHas a diagram

    This flowchart represents an algorithm. The array List[1:5] used in the flowchart contains this data: List[1]: 15 List[2]: 17 List[3]: 20 List[4]: 5 List[5]: 9 Complete the trace table using the data given in the array.

    Try this question
  • Question 7May/June 2023, paper 21Structured7 marks

    The flowchart represents an algorithm. The table represents the two-dimensional (2D) array Word[] which stores the first half of the phonetic alphabet used for radio transmission. For example, Word[10,1] is 'J'.

    Try this question
  • Question 4May/June 2025, paper 22Structured7 marks

    State one reason for using a verification check when inputting data.

    Try this question
  • Question 11May/June 2024, paper 22Structured15 marks

    A one-player game uses the two-dimensional (2D) array Grid[] to store the location of a secret cell to be found by the player in 10 moves. Each row and column has 5 cells.

    Try this question
  • Question 11May/June 2023, paper 21Essay15 marks

    A one-dimensional (1D) array Days[] contains the names of the days of the week. A two-dimensional (2D) array Readings[] is used to store 24 temperature readings, taken once an hour, for each of the seven days of the week.

    Try this question
  • Question 5May/June 2025, paper 22Structured11 marks

    This pseudocode algorithm should allow 500 names of people and their heights to be entered and stored in two one-dimensional (1D) arrays. The name of a person and the height of that person are in the same index in both the Names[] and the Heights[] arrays.

    Try this question
  • Question 12May/June 2023, paper 22Structured15 marks

    A two-dimensional (2D) array Account[] contains account holders’ names and passwords for a banking program.

    Try this question
  • Question 7May/June 2025, paper 22Structured10 marks

    The flowchart shows an algorithm that is used to input 50 numbers. Each number is stored in the variable Value when it is input. Any number input that is less than or equal to –20 or greater than or equal to 50 is rejected and re-input.

    Try this question