plumiOrganisation and structure of data: Eduqas A‑Level Computer Science questions
Every Eduqas A-Level Computer Science exam question on 2.4 Organisation and structure of data, 2016–2025, with its mark scheme and examiner’s report.
Paper
All papers
Exam
All years
Calculations
Q9(a)
The whole paper ↗
Q9(b)
The whole paper ↗Q8(a)
The whole paper ↗
Q8(b)
The whole paper ↗Q11(a)
The whole paper ↗
Q11(b)
The whole paper ↗Q6(a)
The whole paper ↗Q6(b)
The whole paper ↗Q8(a)
The whole paper ↗
Q8(b)
The whole paper ↗Q10(b)
The whole paper ↗
Q10(a)
The whole paper ↗
Q10(b)
The whole paper ↗Q10(c)
The whole paper ↗Q8(a)
The whole paper ↗Q8(b)
The whole paper ↗
All 34 questions on Organisation and structure of data, as a list
- June 2025, Component 2, Q9(a) (3 marks): Explain how the computer would access product record 1955. [3]
- June 2025, Component 2, Q9(b) (5 marks): Explain how new product records 2892 and 2893 would be added to the system, with reference to creating index and data blocks. [5]
- June 2024, Component 2, Q8(a) (4 marks): Compare the use of fixed and variable length records. [4]
- June 2024, Component 2, Q8(b) (6 marks): Describe the organisation and process of using a random access file to store data. [6]
- June 2024, AS Component 1, Q5 (6 marks): Distinguish between the use of serial and sequential file access methods in computer applications. [6]
- June 2024, AS Component 1, Q11(a) (4 marks): Describe this system and the update process for account balances. [4]
- June 2024, AS Component 1, Q11(b) (2 marks): Give two advantages of using this approach for updating account balances. [2]
- June 2023, Component 2, Q6(a) (2 marks): Explain the purpose of a hashing algorithm. [2]
- June 2023, Component 2, Q6(b) (4 marks): This is a simple hashing algorithm for calculating data storage positions in a hash table: Position K = T MOD 99 where T is the total of the ASCII codes of all
- June 2023, AS Component 1, Q8(a) (7 marks): Complete the algorithm, using pseudocode, which allows a user to input a student’s ID to be deleted and then removes that record from the file gradesFile. [7] S
- June 2023, AS Component 1, Q8(b) (2 marks): Describe the need for archiving certain files. [2]
- June 2022, Component 2, Q3 (6 marks): Describe three methods of file access. [6]
- June 2022, AS Component 1, Q10(b) (6 marks): The organisation wishes to explore different methods for backing up its data. Describe different procedures for backing up and recovering data. [6]
- Autumn 2020, Component 2, Q9 (8 marks): Describe a data processing system which makes use of a master file and transaction file to produce utility bills. [8]
- Autumn 2020, Component 2, Q10(a) (1 mark): Calculate the location of a stock record with a key field = 3561220 [1]
- Autumn 2020, Component 2, Q10(b) (3 marks): Explain why this hashing algorithm is unsuitable. [3]
- Autumn 2020, Component 2, Q10(c) (2 marks): Describe a more suitable hashing algorithm for the direct access file. [2]
- June 2019, Component 2, Q8(a) (4 marks): Explain why searching and updating records may be carried out more quickly with fixed length records than with variable length records. [4]
- June 2019, Component 2, Q8(b) (2 marks): Describe a situation in which a programmer may choose to use variable length records in a program. [2]
- June 2019, AS Component 1, Q3 (6 marks): Describe three methods used to ensure file security. [6]
- June 2018, Component 2, Q10(a) (6 marks): random access files [6]
- June 2018, Component 2, Q10(b) (4 marks): indexed sequential files. [4]
- June 2018, AS Component 1, Q4 (5 marks): Describe the difference between fixed and variable length records. Give an example of data that would be contained in a variable length field and an example of
- June 2017, Component 1, Q1(a)(i) (1 mark): Describe one problem that would arise if the seven-digit component numbers were used as disk addresses. [1]
- June 2017, Component 1, Q1(a)(ii) (2 marks): Explain how the hashing algorithm could be used to overcome this problem. [2]
- June 2017, Component 1, Q1(b) (2 marks): The stock control system provides a disk block for each component’s data. Describe how the system could handle data for two stock items which hash to the same d
- June 2017, Component 2, Q8(b) (6 marks): Describe the terms master file and transaction file and give an example of how these files are used. [6]
- June 2017, Component 2, Q9(a) (3 marks): Describe what is meant by an indexed sequential file and give the main advantage of using an indexed sequential file compared with a standard sequential file. [
- June 2017, Component 2, Q9(b) (6 marks): Describe direct (random) access files in terms of hashing algorithms, overflow areas and the need for files to be re-organised on occasions. [6]
- June 2017, AS Component 1, Q10(a) (2 marks): Describe the terms file and record within a computer system. [2]
- June 2017, AS Component 1, Q10(b) (6 marks): Explain what is meant by a fixed length field and a variable length field and give an example of data that could sensibly be stored in each field type. [6]
- June 2017, AS Component 1, Q11(a) (2 marks): Describe indexed sequential file organisation. [2]
- June 2017, AS Component 1, Q11(b) (6 marks): Describe direct (random) access file organisation and how overflow is used. [6]
- June 2017, AS Component 1, Q11(c) (4 marks): Draw a clearly labelled diagram that shows how a transaction file and master file are used to produce a monthly mobile phone bill for each customer. [4]
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.