India - Water

[indiakato]

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 because you want to prevent as many collisions from happening as possible (mapping mostly unique keys to unique values).
How can you judge if a hash function is good or not?	The hash function should have consistent mapping, have mostly unique keys mapping to unique values (low number of collisions), have constant look up time and hashing should appear random.
Is there a perfect hash function? If so what is it?	No
Describe a strategy to handle collisions in a hash table	Chaining - make each bucket of the hash table the head of a linked list.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Binary search trees perform range searches more efficiently.
What is one thing that is more clear to you on hash tables now	How to decide on a good hashing function in terms of the keys you use.

[CheezItMan]

Nice work India, you hit the learning goals here. Well done.

[CheezItMan]

👍 Since you're sorting the strings, the time complexity is O(n + m log m) where m is the length of the words, but if you assume the strings are limited in size, you can say it's O(n).

[CheezItMan]

👍