Earth/Taylor

[TaylorMililani]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	fast lookup
How can you judge if a hash function is good or not?	number of collisions
Is there a perfect hash function? If so what is it?	yes, one without collisions
Describe a strategy to handle collisions in a hash table	find the next empty bucket for collided item
Describe a situation where a hash table wouldn't be as useful as a binary search tree	a bst is more memory efficient so it is more useful when working with large amounts of data if space is an issue, also hash tables cant traverse and list items in order
What is one thing that is more clear to you on hash tables now	they can be more efficient than trees at lookups