Skip to content
Android waitlistTry on iPad

Data structures: AQA GCSE Computer Science questions

Every AQA GCSE Computer Science exam question on 3.2.6 Data structures, 2022–2025, with its mark scheme and examiner’s report.

Paper
All papers
Exam
All years
Calculations

740 questions

  1. Q09

    June 2025 · Paper 1 (C#)

    The whole paper ↗
  2. Q10.1

    June 2025 · Paper 1 (C#)

    The whole paper ↗
  3. Q10.2

    June 2025 · Paper 1 (C#)

    The whole paper ↗
  4. Q10.3

    June 2025 · Paper 1 (C#)

    The whole paper ↗
  5. Q09

    June 2025 · Paper 1 (Python)

    The whole paper ↗
  6. Q10.1

    June 2025 · Paper 1 (Python)

    The whole paper ↗
  7. Q10.2

    June 2025 · Paper 1 (Python)

    The whole paper ↗
  8. Q10.3

    June 2025 · Paper 1 (Python)

    The whole paper ↗
  9. Q09

    June 2025 · Paper 1 (VB.NET)

    The whole paper ↗
  10. Q10.1

    June 2025 · Paper 1 (VB.NET)

    The whole paper ↗
  11. Q10.2

    June 2025 · Paper 1 (VB.NET)

    The whole paper ↗
  12. Q10.3

    June 2025 · Paper 1 (VB.NET)

    The whole paper ↗
  13. Q09.1

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  14. Q09.2

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  15. Q12.1

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  16. Q12.3

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  17. Q12.4

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  18. Q15

    June 2024 · Paper 1 (C#)

    The whole paper ↗
  19. Q09.1

    June 2024 · Paper 1 (Python)

    The whole paper ↗
  20. Q09.2

    June 2024 · Paper 1 (Python)

    The whole paper ↗
All 60 questions on Data structures, as a list
  1. June 2025, Paper 1 (C#), Q09 (2 marks): Figure 9 shows five algorithms, represented using pseudo-code. Figure 9 A numbers  [44, 1, 2, 14, 68] counter  0 total  0 WHILE counter < 5 index  counter t
  2. June 2025, Paper 1 (C#), Q10.1 (1 mark): Figure 11 shows pseudo-code used to create two records using the structure in Figure 10. Figure 11 race1  Runner('400 m', 23, 51.35) race2  Runner('400 m', 14
  3. June 2025, Paper 1 (C#), Q10.2 (1 mark): Complete the line of pseudo-code needed to output the time of race2 [1 mark] OUTPUT race2
  4. June 2025, Paper 1 (C#), Q10.3 (6 marks): The programmer wants to find the fastest time for a particular running event. The times for all the runners in the event are stored in an array of real numbers
  5. June 2025, Paper 1 (Python), Q09 (2 marks): Figure 9 shows five algorithms, represented using pseudo-code. Figure 9 A numbers  [44, 1, 2, 14, 68] counter  0 total  0 WHILE counter < 5 index  counter t
  6. June 2025, Paper 1 (Python), Q10.1 (1 mark): Figure 11 shows pseudo-code used to create two records using the structure in Figure 10. Figure 11 race1  Runner('400 m', 23, 51.35) race2  Runner('400 m', 14
  7. June 2025, Paper 1 (Python), Q10.2 (1 mark): Complete the line of pseudo-code needed to output the time of race2 [1 mark] OUTPUT race2
  8. June 2025, Paper 1 (Python), Q10.3 (6 marks): The programmer wants to find the fastest time for a particular running event. The times for all the runners in the event are stored in an array of real numbers
  9. June 2025, Paper 1 (VB.NET), Q09 (2 marks): Figure 9 shows five algorithms, represented using pseudo-code. Figure 9 A numbers  [44, 1, 2, 14, 68] counter  0 total  0 WHILE counter < 5 index  counter t
  10. June 2025, Paper 1 (VB.NET), Q10.1 (1 mark): Figure 11 shows pseudo-code used to create two records using the structure in Figure 10. Figure 11 race1  Runner('400 m', 23, 51.35) race2  Runner('400 m', 14
  11. June 2025, Paper 1 (VB.NET), Q10.2 (1 mark): Complete the line of pseudo-code needed to output the time of race2 [1 mark] OUTPUT race2
  12. June 2025, Paper 1 (VB.NET), Q10.3 (6 marks): The programmer wants to find the fastest time for a particular running event. The times for all the runners in the event are stored in an array of real numbers
  13. June 2024, Paper 1 (C#), Q09.1 (1 mark): Which of the following best describes a data structure? Shade one lozenge. [1 mark] A A number with a fractional part B A value such as a whole number C All of
  14. June 2024, Paper 1 (C#), Q09.2 (3 marks): Figure 7 shows an incomplete algorithm, represented using pseudo-code. The algorithm is used to store and manage books using records. The algorithm should do th
  15. June 2024, Paper 1 (C#), Q12.1 (2 marks): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  16. June 2024, Paper 1 (C#), Q12.3 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  17. June 2024, Paper 1 (C#), Q12.4 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  18. June 2024, Paper 1 (C#), Q15 (8 marks): A programmer is writing a game. The game uses a row of cells represented as an array. Figure 20 shows an example. Figure 20 0 1 2 3 4 5 6 7 X X Figure 21 descri
  19. June 2024, Paper 1 (Python), Q09.1 (1 mark): Which of the following best describes a data structure? Shade one lozenge. [1 mark] A A number with a fractional part B A value such as a whole number C All of
  20. June 2024, Paper 1 (Python), Q09.2 (3 marks): Figure 7 shows an incomplete algorithm, represented using pseudo-code. The algorithm is used to store and manage books using records. The algorithm should do th
  21. June 2024, Paper 1 (Python), Q12.1 (2 marks): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  22. June 2024, Paper 1 (Python), Q12.3 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  23. June 2024, Paper 1 (Python), Q12.4 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  24. June 2024, Paper 1 (Python), Q15 (8 marks): A programmer is writing a game. The game uses a row of cells represented as a list. Figure 20 shows an example. Figure 20 0 1 2 3 4 5 6 7 X X Figure 21 describe
  25. June 2024, Paper 1 (VB.NET), Q09.1 (1 mark): Which of the following best describes a data structure? Shade one lozenge. [1 mark] A A number with a fractional part B A value such as a whole number C All of
  26. June 2024, Paper 1 (VB.NET), Q09.2 (3 marks): Figure 7 shows an incomplete algorithm, represented using pseudo-code. The algorithm is used to store and manage books using records. The algorithm should do th
  27. June 2024, Paper 1 (VB.NET), Q12.1 (2 marks): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  28. June 2024, Paper 1 (VB.NET), Q12.3 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  29. June 2024, Paper 1 (VB.NET), Q12.4 (1 mark): 1 2 A program is being written to solve a sliding puzzle. • The sliding puzzle uses a 3 x 3 board. • The board contains eight tiles and one blank space. • Each
  30. June 2024, Paper 1 (VB.NET), Q15 (8 marks): A programmer is writing a game. The game uses a row of cells represented as an array. Figure 20 shows an example. Figure 20 0 1 2 3 4 5 6 7 X X Figure 21 descri
  31. June 2023, Paper 1 (C#), Q09.2 (1 mark): Which assignment statement changes the year the film Hulk was made to 2003? Shade one lozenge. [1 mark] A hulk.year  2003 B filmCollection[0].year  2003 C Fil
  32. June 2023, Paper 1 (C#), Q09.3 (1 mark): What should the label in Figure 8 be replaced by? Shade one lozenge. [1 mark] A 3 B LEN(filmCollection) C LEN(filmCollection) – 1 D Position
  33. June 2023, Paper 1 (C#), Q09.4 (1 mark): Write a pseudo-code statement that updates the antMan record to show that the film is currently being shown at the cinema. [1 mark]
  34. June 2023, Paper 1 (C#), Q14 (3 marks): 50 students have voted for the music genre they like best. Figure 16 shows an incomplete algorithm, represented using pseudo-code, designed to output the highes
  35. June 2023, Paper 1 (Python), Q09.2 (1 mark): Which assignment statement changes the year the film Hulk was made to 2003? Shade one lozenge. [1 mark] A hulk.year  2003 B filmCollection[0].year  2003 C Fil
  36. June 2023, Paper 1 (Python), Q09.3 (1 mark): What should the label in Figure 8 be replaced by? Shade one lozenge. [1 mark] A 3 B LEN(filmCollection) C LEN(filmCollection) – 1 D Position
  37. June 2023, Paper 1 (Python), Q09.4 (1 mark): Write a pseudo-code statement that updates the antMan record to show that the film is currently being shown at the cinema. [1 mark]
  38. June 2023, Paper 1 (Python), Q14 (3 marks): 50 students have voted for the music genre they like best. Figure 16 shows an incomplete algorithm, represented using pseudo-code, designed to output the highes
  39. June 2023, Paper 1 (VB.NET), Q09.2 (1 mark): Which assignment statement changes the year the film Hulk was made to 2003? Shade one lozenge. [1 mark] A hulk.year  2003 B filmCollection[0].year  2003 C Fil
  40. June 2023, Paper 1 (VB.NET), Q09.3 (1 mark): What should the label in Figure 8 be replaced by? Shade one lozenge. [1 mark] A 3 B LEN(filmCollection) C LEN(filmCollection) – 1 D Position
  41. June 2023, Paper 1 (VB.NET), Q09.4 (1 mark): Write a pseudo-code statement that updates the antMan record to show that the film is currently being shown at the cinema. [1 mark]
  42. June 2023, Paper 1 (VB.NET), Q14 (3 marks): 50 students have voted for the music genre they like best. Figure 16 shows an incomplete algorithm, represented using pseudo-code, designed to output the highes
  43. June 2022, Paper 1 (C#), Q05.3 (1 mark): What type of data structure is the variable numbers? [1 mark]
  44. June 2022, Paper 1 (C#), Q09.2 (1 mark): Shade one lozenge which shows the output of line 5 from the algorithm shown in Figure 8. [1 mark] A 1 B 2 C 4 D 5 E 10
  45. June 2022, Paper 1 (C#), Q12.3 (1 mark): Figure 13 has been included again below. Figure 13 1 arr[0]  'c' 2 arr[1]  'b' 3 arr[2]  'a' 4 FOR i  0 TO 1 5 FOR j  0 TO 1 6 IF arr[j + 1] < arr[j] THEN
  46. June 2022, Paper 1 (C#), Q13.2 (6 marks): There are 500 cards within the game in total. Each card is numbered from 1 to 250 and each number appears twice in the whole set of cards. The player’s 100 card
  47. June 2022, Paper 1 (C#), Q14.1 (4 marks): Figure 16 shows an incomplete C# program to create a bingo ticket for a player. The programmer has used a two-dimensional array called ticket to represent a bin
  48. June 2022, Paper 1 (C#), Q14.2 (8 marks): Each time a player answers a question correctly the ticket array is updated; if their answer is in the ticket array then it is replaced with an asterisk (*). An
  49. June 2022, Paper 1 (Python), Q05.3 (1 mark): What type of data structure is the variable numbers? [1 mark]
  50. June 2022, Paper 1 (Python), Q09.2 (1 mark): Shade one lozenge which shows the output of line 5 from the algorithm shown in Figure 8. [1 mark] A 1 B 2 C 4 D 5 E 10
  51. June 2022, Paper 1 (Python), Q12.3 (1 mark): Figure 13 has been included again below. Figure 13 1 arr[0]  'c' 2 arr[1]  'b' 3 arr[2]  'a' 4 FOR i  0 TO 1 5 FOR j  0 TO 1 6 IF arr[j + 1] < arr[j] THEN
  52. June 2022, Paper 1 (Python), Q13.2 (6 marks): There are 500 cards within the game in total. Each card is numbered from 1 to 250 and each number appears twice in the whole set of cards. The player’s 100 card
  53. June 2022, Paper 1 (Python), Q14.1 (4 marks): Figure 16 shows an incomplete Python program to create a bingo ticket for a player. The programmer has used a two-dimensional array called ticket to represent a
  54. June 2022, Paper 1 (Python), Q14.2 (8 marks): Each time a player answers a question correctly the ticket array is updated; if their answer is in the ticket array then it is replaced with an asterisk (*). An
  55. June 2022, Paper 1 (VB.NET), Q05.3 (1 mark): What type of data structure is the variable numbers? [1 mark]
  56. June 2022, Paper 1 (VB.NET), Q09.2 (1 mark): Shade one lozenge which shows the output of line 5 from the algorithm shown in Figure 8. [1 mark] A 1 B 2 C 4 D 5 E 10
  57. June 2022, Paper 1 (VB.NET), Q12.3 (1 mark): Figure 13 has been included again below. Figure 13 1 arr[0]  'c' 2 arr[1]  'b' 3 arr[2]  'a' 4 FOR i  0 TO 1 5 FOR j  0 TO 1 6 IF arr[j + 1] < arr[j] THEN
  58. June 2022, Paper 1 (VB.NET), Q13.2 (6 marks): There are 500 cards within the game in total. Each card is numbered from 1 to 250 and each number appears twice in the whole set of cards. The player’s 100 card
  59. June 2022, Paper 1 (VB.NET), Q14.1 (4 marks): Figure 16 shows an incomplete VB.Net program to create a bingo ticket for a player. The programmer has used a two-dimensional array called ticket to represent a
  60. June 2022, Paper 1 (VB.NET), Q14.2 (8 marks): Each time a player answers a question correctly the ticket array is updated; if their answer is in the ticket array then it is replaced with an asterisk (*). An

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.