Hash tables and dictionaries
AQA 75174.2 L7A-levelLesson packSubscription
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.
- 12 questions
- 31 marks
- about 35 minutes
- marked instantly
Question types: short answer, multiple choice, matching, true or false.
Try one from this worksheet
Identify the task that a hash table is best suited to.
Pick an answer: it's marked straight away, just as your pupils would see it.
About this resource
AQA A-level Computer Science (7517) 4.2.1.4 Abstract data types: hash tables, dictionaries · 4.2.6.1 Hash tables · 4.2.7.1 Dictionaries. C# lesson 7 of 8 in 4.2 Fundamentals of data structures: a trace-the-tree Do Now, a short key idea, an 11-challenge ladder in three sets with exact test data, t…
19 slides.
Lesson outline
- Do Now: trace the binary search tree
- Do Now: answers
- Key idea: A hash table: from key to slot
- Key idea: Collisions and rehashing
- Check: where does 20 go?
- Key idea: Search and delete
- Key idea: Dictionaries
- Key idea: Dictionaries: check your predictions
- Set 1: hash functions
- Set 2: build a hash table
- Exam question E1: why a hash table?
- Model answer E1
Unit bundle4.2 Data structures · full C# lessons
More from 4.2 Data structures · full C# lessons
- Lesson pack · 4.2 L1Arrays, lists and recordsSubscription
- Lesson pack · 4.2 L2Text and binary filesSubscription
- Lesson pack · 4.2 L3Queues: linear, circular and prioritySubscription
- Lesson pack · 4.2 L4StacksSubscription
- Lesson pack · 4.2 L5GraphsSubscription
- Lesson pack · 4.2 L6Trees and binary search treesSubscription
- Lesson pack · 4.2 L8VectorsSubscription


