Evelynn

[evelynnkaplan]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	It helps avoid collision and keeps lookup time O(1).
How can you judge if a hash function is good or not?	A hash function is good if it spreads values out evenly, if keys that are close in value get mapped to widely different values, if it can quickly calculate the mapped value for a key, and if it appears to be random.
Is there a perfect hash function? If so what is it?	No.
Describe a strategy to handle collisions in a hash table	Chaining - create a linked list where the first value mapped to an index will store the memory address of the next value that's mapped to that index, and so on.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	When order matters and you may need to be searching throughout the data set.
What is one thing that is more clear to you on hash tables now	Various ways to resolve collisions.

[CheezItMan]

That will do it. Nice work.

[CheezItMan]

Assuming the words are small yes. If the words can be of arbitrary size, you need to consider the time to sort the words.