Kelly

[kdow]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Good hash functions will provide constant lookup time, whereas bad hash functions can get up to linear lookup time.
How can you judge if a hash function is good or not?	Constant lookup time, consistent but appears random, elements distributed uniformly across the collection.
Is there a perfect hash function? If so what is it?	No
Describe a strategy to handle collisions in a hash table	Chaining will make each bucket of the hash table's internal array the head of a linked list which subsequent element can be added on to.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	When the order of the elements is important.
What is one thing that is more clear to you on hash tables now	Hash functions

[CheezItMan]

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

[CheezItMan]

If the strings are small enough, yes.

[CheezItMan]

Why put the indexes into grouped instead of putting the words in the first place? Just seems a little odd.