Space - Faezeh

[faezeh-ashtiani]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	It reduces the collision possibility in the hash table and it disperses the values in the table better
How can you judge if a hash function is good or not?	If it reduces collision
Is there a perfect hash function? If so what is it?	no there is no perfect hash functions. they are known to be heuristic which means they are for the most part well functional but there are instances that they do not satisfy.
Describe a strategy to handle collisions in a hash table	one method is chaining, in which each spot in the hash table is a linked list in which adding or removing a value is rather easy.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	when we need a sorted data structure
What is one thing that is more clear to you on hash tables now	that the hash function in different languagea is behind the curtains and the developers can work to make them more efficient without changing the public interface

[CheezItMan]

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

[CheezItMan]

👍 Nicely done

[CheezItMan]

👍 Clever use of max(k) to find the most common k elements in O(n) time.