Sarah

[sjscotton]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Its the reason we can achieve 0(1) lookup on Hash tables
How can you judge if a hash function is good or not?	Its spreads items out evenly, It should be quick, and the same key should always produce the same result.
Is there a perfect hash function? If so what is it?	no
Describe a strategy to handle collisions in a hash table	One strategy is chaining, where when you have a collision you add the item to the back of a linked list connected to that bucket.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Anytime you want the items sorted, Hash tables dont have any ordering at all
What is one thing that is more clear to you on hash tables now	How hash tables operate behind the scenes.

[CheezItMan]

You have the exact answer here, well done!

[CheezItMan]

Exactly