AQA 7517 4.2.1.3: Fields, records and files
The free BugBot lessons that teach this point, a robot to try it on, and the past-paper questions that test it.
What it covers
A data structure is a way of organising data in memory so a program can use it efficiently. At GCSE you met lists as one-dimensional arrays, two-dimensional arrays for the depth grid, and records for the robot's readings (module F3). At A level you need to say exactly what each structure is, how it is laid out in memory, and why you would choose it. This module works through the structures on the specifications, starting with the simplest: arrays, records and tuples.
- Arrays
- Two and three dimensions
- Records and fields
- Tuples and lists
Or do it in the simulator, with tasks that mark themselves
Lessons that teach it
- A3.1 Arrays, records and tuples Data structures
Arrays in one, two and three dimensions, records and fields, tuples and lists, and static structures. - A3.8 Fields, records and file organisation Data structures
Text and binary files, fixed-length records, and serial, sequential, indexed sequential and direct access files.
Try it on a robot
The task from A3.1 Arrays, records and tuples, running here. Change the program and press Run.
The specification is AQA's own document; this page says which of our lessons teach point 4.2.1.3 and is not endorsed by the board.