Data structures — AQA GCSE Computer Science

Data structures allow programmers to group, manage, and manipulate related collections of data efficiently under a single identifier rather than declaring dozens of individual variables. In AQA GCSE Computer Science, students are required to understand static 1D arrays, 2D arrays, and heterogeneous records.

Understanding these structures underpins algorithm design, file handling, and database concepts. Whether sorting student exam results or rendering a board for a tic-tac-toe game, selecting the correct data structure dictates memory efficiency and processing logic.

• →Static 1D Array: A fixed-size, indexed collection of items of the same data type stored in contiguous memory locations.
• →2D Array: An array of arrays, visualised as a grid with rows and columns, accessed using two index pointers: array[row][col].
• →Record: A composite data structure that can store related fields of differing data types under named attributes for a single entity.
• →Zero-based Indexing: The standard addressing system where the first element is at index 0 and the final element is at index length - 1.

• Identifies the entities in the problem and defines a record for each, naming the record clearly.
• Lists the fields of each record with an appropriate data type for each field.
• Explains how records are stored, for example in an array of records, to hold multiple instances.
• Shows how an individual field is accessed or updated within a record.
• Justifies why a record is suitable for grouping related data of different types.

• 💡Start by listing the entities in the problem, then define one record per entity with named, typed fields.
• 💡State the data type of every field explicitly to show a complete design.
• 💡Explain how multiple records are stored, such as an array of records, and how one field is read or changed.
• 💡Always state whether your index begins at 0 or 1 if writing freehand pseudocode, though adhering to standard 0-indexing is strongly expected by AQA mark schemes.
• 💡When traversing a 2D array, clearly distinguish between the inner and outer loop counters (e.g., use 'row' and 'col' instead of vague letters like 'i' and 'j' to avoid indexing errors).

• Defining a record with fields but no data types: each field should have a stated type such as string, integer or real.
• Using a single array of one type to hold unrelated data: a record groups related fields of different types under one name.
• Forgetting how to access a field: state that a field is reached through the record name and field name, not by a single index alone.
• Believing arrays can hold mixed data types; in classical computer science and the AQA specification, arrays are strictly homogeneous (storing elements of one data type only), unlike records or Python lists.
• Confusing records with files; a record represents a single structured entry (like a row in a table), while a file is a secondary storage container that holds multiple records.
• Assuming an array's size can dynamically expand during runtime; classical arrays are static data structures with fixed size defined at declaration.

1. 1Day 1-2: Master 1D arrays by practicing traversal, searching, and linear accumulation using standard pseudocode.
2. 2Day 3-4: Learn 2D array coordinates, nested loops, and matrix processing algorithms such as finding maximum values.
3. 3Day 5: Practice defining and accessing record structures with mixed data types and dot notation (e.g., student.firstName).
4. 4Day 6-7: Complete past AQA Paper 1 algorithm questions specifically requiring 2D arrays and records under timed conditions.

• 📋Pseudocode Tracing: Stepping through trace tables tracking values inside 1D or 2D arrays across nested loops.
• 📋Algorithm Writing: Constructing pseudocode or high-level code to search, filter, or calculate statistics from an array.
• 📋Record Structure Definition: Defining a record format by specifying field names and appropriate data types for a given scenario.