It includes:
- Student Learning Record (A3 version in word)
- Student Learning Record (PDF version)
- Student Learning Record (PowerPoint version)
- Set of student activities and workshops with answers
- Answers to the exam questions from the back of the SLR
- Teacher Marking Checklist
- Year 13 Recap Lesson
This topic covers:
H046
- 1.4.2 a-b Data Structures
H446
- 1.4.2 a-c Data Structures
Specific knowledge required for AS and A Level:
- Candidates should be able to describe what is meant by arrays (up to 3 dimensions), records, lists and tuples.
- Candidates are expected to be able recognise when they can be used and incorporate them in their programs to store data.
- Candidates should have an understanding of the purpose and use of a record structure to store data of different data types in a program.
- Candidates should have experience of using records to store, search, manipulate and retrieve data.
- Candidates should have an understanding of the purpose and use of a list to store data in a program.
- Candidates should have experience of using lists to store, search, manipulate and retrieve data.
- Candidates should have an understanding of the purpose and use of tuples to store data in a program.
- Candidates should have experience of using tuples to store, search, manipulate and retrieve data.
- Candidates need to have an understanding of the behaviour of stacks and queues (i.e. LIFO and FIFO).
Specific knowledge required for A Level ONLY:
- Candidates need to have an understanding of the behaviour of linked-lists, graphs, stacks, queues, trees, binary search trees and hash tables.
- Candidates need to be able be aware of how the aforementioned data structures can be implemented. We would recommend a general understanding of these principles that can be applied to a given scenario rather than trying to memorise code patterns.
- Candidates should have experience of implementing these structures in a variety of contexts, for example through a procedural program, through a different data structure and through an object-oriented approach.
- Candidates need to be able to read, trace and write code to implement features of these data structures. (Again we would recommend a general understanding backed up with practice implementing them, rather than trying to memorise code patterns).
Static link to the videos for this topic:
We update our flipped classroom videos from time-to-time to keep them relevant. This can be troublesome if you put links to the videos on your VLE because the hyperlink address will change with each update. The link below will take you to a static playlist for all the videos in this section that you can safely put on your VLE, ensuring you always have a path to the latest videos, and no broken links.
