Data Structures: Arrays, Records, Files & Abstract Data Types
AQA 75174.2aA-levelWorksheetSubscription

Also online
This worksheet marks itself
Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.
- 11 questions
- 45 marks
- about 55 minutes
- marked instantly
Question types: multi-part, multiple choice, short answer, true or false, fill the gap.
About this resource
AQA A-level Computer Science (7517) Paper 1, full 4.2.1 — the concept of a data structure in familiar/practical contexts (4.2.1.1); one-dimensional arrays as vectors and two-dimensional arrays as matrices, with the general n-dimensional array as a set of same-type elements indexed by a tuple of n…
Lesson outline
- Do Now — Retrieval from Prior Programming Fundamentals
- Quick Check — Everyday 'Record' vs Technical 'Record'
- I-Do: The Concept of a Data Structure
- Hinge Check — Is a Data Structure Just Another Name for an Array?
- I-Do: One-Dimensional Arrays as a Vector
- We-Do: 1D Array Indexing
- We-Do — True or False: 1D Array Indexing
- I-Do: Two-Dimensional Arrays, n-Dimensional Arrays and Tuples
- We-Do: A Tuple Locates One Cell in a Matrix
- Hinge Check — Does Every Array Need a Tuple of Exactly 2 Integers?
- We-Do — Design a Solution Using an Array: Weekly Rainfall
- I-Do: Fields, Records and Files
Unit bundlePaper 1
More from 4.2 Fundamentals of data structures
- Lesson pack · 4.2.1Data Structures, Arrays, Records & ADTsSubscription
- Lesson pack · 4.2.2–4.2.3Queues and StacksSubscription
- Lesson pack · 4.2.4GraphsSubscription
- Lesson pack · 4.2.5TreesSubscription
- Lesson pack · 4.2.6–4.2.7Hash Tables and DictionariesSubscription
- Lesson pack · 4.2.8VectorsSubscription
- Knowledge organiser · 4.2Data Structures Part 1Subscription
- Knowledge organiser · 4.2Data Structures (Part 2) — Graphs and TreesSubscription


