IGCSE Computer Science 0478, topic 8.2

Arrays: past paper questions

44 Cambridge IGCSE Computer Science 0478 questions on Arrays (8.2) from 21 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
44
Papers
21
Years
2023 to 2026
Total marks
501
Average per question
11.4 marks
Largest question
15 marks

By type: Multiple choice 1 · Structured 39 · Essay 4

How hard the questions are

  • Recall1
  • Apply7
  • Analyse35
  • Not banded1

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

  • explainAnalyse24 questions

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

  • suggestAnalyse14 questions

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

  • completeApply10 questions
  • writeRecall9 questions
  • describeApply4 questions

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

  • identifyRecall4 questions

    name/select/recognise

  • stateRecall3 questions

    express in clear terms

  • showApply2 questions
  • analyseAnalyse1 question
  • compareAnalyse1 question

    identify/comment on similarities and/or differences

Where the questions come from

By year

  • 20266
  • 202513
  • 202411
  • 202314

By session

  • May/June23
  • Oct/Nov21

By paper

  • Paper 244

Questions on this topic

Showing 30 of 44, 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 11Oct/Nov 2025, paper 21Structured15 marks

    The scores for each competitor in an archery competition are recorded. The one-dimensional (1D) array CompetitorName[] is used to store the names of the competitors. The maximum number of competitors is 30.

    Try this question
  • Question 6Oct/Nov 2024, paper 21Structured9 marksHas a diagram

    An incomplete algorithm has been written in pseudocode to count the number of zeros stored in an array and total the non-zero values.

    Try this question
  • Question 4Oct/Nov 2023, paper 21Structured3 marks

    Circle the three words representing places where data may be stored. array constant dimension input output procedure variable Circle the three words representing places where data may be stored. array constant dimension input output procedure variable

    Try this question
  • Question 12May/June 2026, paper 21Structured15 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 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 11Oct/Nov 2024, paper 21Structured15 marks

    A running club has 200 members who compete in a 1-kilometre running competition every month.

    Try this question
  • Question 6Oct/Nov 2023, paper 21Structured10 marksHas a diagram

    An algorithm has been written in pseudocode.

    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 5Oct/Nov 2025, paper 22Structured13 marksHas a diagram

    This flowchart represents an algorithm. The first data row of the trace table shows the values currently stored in CodeStore[] Complete the trace table for the algorithm, using the input data: 7686, Face, Speed, 432U, Yp79

    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 10Oct/Nov 2023, paper 21Structured15 marks

    Drama students put on a performance of a play for one evening. Seats in a small theatre can be booked for this performance. The theatre has 10 rows of 20 seats.

    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 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 100000 random integers.

    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 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 4May/June 2026, paper 23Structured10 marksHas a diagram

    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[].

    Try this question
  • Question 6Oct/Nov 2025, paper 23Structured9 marksHas a diagram

    The flowchart represents an algorithm.

    Try this question
  • Question 6Oct/Nov 2024, paper 23Structured9 marks

    An incomplete algorithm has been written in pseudocode to count the number of values stored in an array and to find their average.

    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 10May/June 2026, paper 23Essay15 marks

    Five rivers show signs of pollution and are to be monitored daily for a period of 30 days.

    Try this question
  • Question 7Oct/Nov 2025, paper 23Structured8 marks

    An algorithm has been written in pseudocode to: • input a whole number between 1 and 255 inclusive • convert the input to an 8-bit binary number • store each bit of the binary number in an array.

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

    Members of a litter picking group complete a litter pick every month.

    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 10Oct/Nov 2025, paper 23Essay15 marks

    A number game has two players. Random whole numbers are generated for each player. The numbers are compared and players are given points based on the result of the comparison.

    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 5Oct/Nov 2023, paper 23Structured9 marksHas a diagram

    An algorithm has been written in pseudocode to check if a new password is in a list of previously used passwords OldList[] If the password is not found, the new password will be stored at the end of the list to replace "XXXX" already stored there.

    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 10Oct/Nov 2023, paper 23Essay15 marks

    A weather station takes temperature readings once an hour for a week. These temperatures are stored in a two-dimensional (2D) array Temperatures[] Each column contains 24 readings for a single day. The first temperature is recorded at 00:00 and the final temperature at 23:00.

    Try this question