Amy P

[aphunk]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	A good hash function is important, as it can make for a quick lookup, as well as avoid collisions through even distribution of values.
How can you judge if a hash function is good or not?	A good hash function is quick to compute hash values, distributes values evenly, keeps a good amount of distance between keys with similar values, and has a seemingly random distribution pattern.
Is there a perfect hash function? If so what is it?	No, sir.
Describe a strategy to handle collisions in a hash table	Using quadratic probing to find a new designation for the collided value -- this is additionally beneficial in avoiding clustering.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	A binary search tree is more useful in situations where the order of the data matters.
What is one thing that is more clear to you on hash tables now	The application of hash tables in computing is more clear now, as well as the idea of a good hash function.

[CheezItMan]

Nice work, you did the requirements here, well done.

[CheezItMan]

Assuming the words are small, yes.

[CheezItMan]

You just need to limit the return to the 1st k elements, but otherwise you have it.