Hash Tables and Dictionaries (AQA A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What makes hash tables exceptionally efficient for searching?
What makes hash tables exceptionally efficient for searching?
Data retrieved in one step, no checking all
What are the two main components of a hash table?
What are the two main components of a hash table?
A table/array of slots and a key
What is the load factor in a hash table?
What is the load factor in a hash table?
Ratio of occupied indices to total indices
What is clustering in the context of hashing algorithms?
What is clustering in the context of hashing algorithms?
Non-random distribution of indices
What is a collision in a hash table?
What is a collision in a hash table?
Same index produced for different keys
How does chaining handle collisions?
How does chaining handle collisions?
Creates linked list at collision point
What technique does rehashing use to find an empty slot?
What technique does rehashing use to find an empty slot?
Probing
Which application uses hashing to verify data hasn't been corrupted during transmission?
Which application uses hashing to verify data hasn't been corrupted during transmission?
Checksums
What key characteristic distinguishes dictionary data structures?
What key characteristic distinguishes dictionary data structures?
Data is unordered
What values are used when hashing non-numeric keys like text?
What values are used when hashing non-numeric keys like text?
ASCII or Unicode values for each character