plumiData structures: Eduqas A‑Level Computer Science questions
Every Eduqas A-Level Computer Science exam question on 1.1 Data structures, 2016–2025, with its mark scheme and examiner’s report.
Paper
All papers
Exam
All years
Calculations
Q1(a)(i)
The whole paper ↗
Q1(a)(ii)
The whole paper ↗Q1(a)(iii)
The whole paper ↗Q1(a)(iv)
The whole paper ↗Q1(b)
The whole paper ↗Q7(a)
The whole paper ↗
Q7(b)
The whole paper ↗Q1(a)
The whole paper ↗Q1(b)
The whole paper ↗Q1(c)(i)
The whole paper ↗Q1(c)(ii)
The whole paper ↗Q7(a)
The whole paper ↗
Q7(b)
The whole paper ↗Q7(c)
The whole paper ↗Q6(c)
The whole paper ↗Q1(a)
The whole paper ↗Q1(b)(i)
The whole paper ↗Q1(b)(ii)
The whole paper ↗Q1(a)
The whole paper ↗
Q1(b)
The whole paper ↗
All 46 questions on Data structures, as a list
- June 2025, Component 1, Q1(a)(i) (3 marks): Construct a binary tree using these rules and the data entered in the following order: Halifax, Leeds, Bradford, Doncaster, Chelmsford, Birmingham, Sheffield, Y
- June 2025, Component 1, Q1(a)(ii) (1 mark): Carry out an in-order traversal of the tree. [1]
- June 2025, Component 1, Q1(a)(iii) (1 mark): Carry out a pre-order traversal of the tree. [1]
- June 2025, Component 1, Q1(a)(iv) (1 mark): Carry out a post-order traversal of the tree. [1]
- June 2025, Component 1, Q1(b) (4 marks): Describe two situations in which a binary tree would be the preferred method of data storage over a linked list. [4]
- June 2025, Component 1, Q7(a) (3 marks): Draw a clearly labelled diagram to show how the above queue can be represented using a one-dimensional array and necessary pointers. [3]
- June 2025, Component 1, Q7(b) (1 mark): Give another example of when a queue data structure might be used. [1]
- June 2024, Component 1, Q1(a) (4 marks): Explain the characteristics of a linked list data structure. [4]
- June 2024, Component 1, Q1(b) (4 marks): Explain the characteristics of a hash table data structure. [4]
- June 2024, Component 1, Q1(c)(i) (2 marks): Redraw the hash table after the data item “Fifth, 20” has been added and “Sixth, 0” has been deleted. [2]
- June 2024, Component 1, Q1(c)(ii) (2 marks): State how you access the value 60 [2]
- June 2023, Component 1, Q7(a) (2 marks): Draw a representation of a linked list tree using suitable example values. [2]
- June 2023, Component 1, Q7(b) (3 marks): Explain why inserting slides in a linked list is more effective than using an array. [3]
- June 2023, Component 1, Q7(c) (4 marks): Other than an array or linked list, select an appropriate data structure to store edits made to a slide and explain how this data structure operates. [4]
- June 2023, Component 2, Q6(c) (2 marks): Identify two methods for storing the calculated data storage positions, K, of both key fields given in part (b) in a hash table. [2]
- June 2022, Component 1, Q1(a) (4 marks): Explain, giving a suitable example, the operation of a hash table data structure. [4]
- June 2022, Component 1, Q1(b)(i) (2 marks): Describe what would happen if an attempt was made to insert an item of data at snowfall_dataset[10]. [2]
- June 2022, Component 1, Q1(b)(ii) (2 marks): Explain why a one-dimensional array is suitable for storing the data in the snowfall_dataset. [2]
- Autumn 2021, Component 1, Q1(a) (4 marks): Describe the characteristics of the linked list. [4]
- Autumn 2021, Component 1, Q1(b) (2 marks): Redraw the linked list with the data item 55 added. [2]
- Autumn 2021, Component 1, Q1(c) (2 marks): Redraw the amended linked list with the data item 73 deleted. [2]
- Autumn 2021, Component 1, Q7(a) (3 marks): In-order traversal [3]
- Autumn 2021, Component 1, Q7(b) (3 marks): Post-order traversal [3]
- Autumn 2021, Component 1, Q7(c) (3 marks): Pre-order traversal [3]
- Autumn 2020, Component 1, Q7(a) (2 marks): Draw a representation of an unbalanced binary tree using suitable example key values. [2]
- Autumn 2020, Component 1, Q7(b) (3 marks): Describe the most efficient way to traverse the above binary tree when searching for a song. [3]
- Autumn 2020, Component 1, Q7(c) (4 marks): Other than an array, select and justify an appropriate data structure to store each playlist. [4]
- Autumn 2020, AS Component 1, Q8(a) (2 marks): Describe the term data structure and why data structures are useful in computing. [2]
- Autumn 2020, AS Component 1, Q8(b)(i) (3 marks): State the essential features of an array and give one example of a situation where the organisation might use a two-dimensional array in connection with the sal
- Autumn 2020, AS Component 1, Q8(b)(ii) (3 marks): Describe the term record and give one example of a situation where the organisation might use a record in connection with its products. [3]
- June 2019, Component 1, Q12(a) (2 marks): Describe a queue data structure. [2]
- June 2019, Component 1, Q12(b)(i) (3 marks): Draw a clearly labelled diagram to show how the above queue can be represented using a one-dimensional array and pointers. [3]
- June 2019, Component 1, Q12(b)(ii) (2 marks): Write an algorithm to remove a person from the queue or identify if the queue is empty. [2]
- June 2019, Component 1, Q13(a) (3 marks): Draw a representation of the binary tree using the following key values in the order below: 11114, 11134, 11126, 11121, 11110, 11113, 11111 [3]
- June 2019, Component 1, Q13(b) (3 marks): Show how the above binary tree can be represented using a two-dimensional array. [3]
- June 2019, Component 1, Q13(c) (1 mark): Redraw the tree with 11110 deleted. [1]
- June 2019, AS Component 1, Q5 (7 marks): Write an algorithm, using pseudo-code, which will allow chemistry students to input the group number (1-18) and the period number (1-7) of an element in the par
- June 2018, Component 1, Q7(a) (5 marks): Describe a stack data structure. [5]
- June 2018, Component 1, Q7(b) (2 marks): Write an algorithm to add an item to a stack. [2]
- June 2018, Component 1, Q7(c) (2 marks): Write an algorithm to remove an item from a stack. [2]
- June 2018, Component 1, Q11(a) (3 marks): Draw a representation of the binary tree using the following key values in this order: Peugeot, Ford, Vauxhall, Mercedes, BMW, Audi, Renault, Toyota. [3]
- June 2018, Component 1, Q11(b) (1 mark): Add Jaguar to the binary tree. [1]
- June 2018, Component 1, Q11(c) (2 marks): List the key values sorted in the order that a post-order traversal of the tree would produce. [2]
- June 2017, Component 1, Q11(a) (3 marks): Draw a representation of the binary tree using the following key values: Philips, Samsung, Blaupunkt, Toshiba, Techwood, Sony, Panasonic, LG [3]
- June 2017, Component 1, Q11(b) (1 mark): Add Hisense to the binary tree. [1]
- June 2017, Component 1, Q11(c) (2 marks): List the key values sorted in the order that a pre-order traversal of the tree would produce. [2]
Questions, mark schemes and examiner’s reports are © WJEC Eduqas, 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.