Topic study hub
Hash tables
Official AQA 7517 section 4.2.6.
0
Objectives
5
Flashcards
7
Questions
36 min
Study time
AqaA LevelComputer ScienceFundamentals of data structures
Choose a revision tool
Start revising Hash tables
Syllabus checklist
What you need to know
0 objective pages available
Hash tables1 objectives
- Hash tables: Be familiar with the concept of a hash table and its uses. A hash table is a data structure that creates a mapping between keys and values. Be able to apply simple hashing algorithms. Know what is meant by a collision and how collisions are handled using rehashing. A collision occurs when two key values compute the same hash.
Key terms
Hash tableCollision
Exam tips
- Show the hash calculation: Write the calculation for each key, including any modulo operation, before deciding whether a collision has occurred.
Common mistakes
- Confusing a collision with duplicate values: A collision occurs when two different key values compute the same hash; the associated values do not have to be identical.
Practice preview
Continue by objective
Objectives are grouped by subtopic so students can jump straight to the exact skill they want to revise.
Related topics