Hash Tables Flashcards
1
Q
What is a hash table
A
An abstract data type that stores items so they can quickly be located by deriving the storage address by calculation
2
Q
What is a hash table collision?
A
Two or more items that have the same storage address.
3
Q
How can collisions be handled?
A
- Use a stronger hashing algorithm
- Place item in next available storage address
- Chaining via a linked list in that address
