Faiza

[Faiza1987]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	It will make your app/algorithm more efficient
How can you judge if a hash function is good or not?	A good hash function will have minimal collisions and avoid the clustering of data by using a quadratic formula.
Is there a perfect hash function? If so what is it?	It is called a Minimal Perfect Hashing and can build a hash table with no collisions. It is only possible to build it if we know all the keys in advance, so there will be one slot for each key.
Describe a strategy to handle collisions in a hash table	Linear probing: if a collision occurs, the algorithm will probe each index below the one where the collision occurred until it finds an empty spot.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	A hash table would not be ideal in any situation where the data must be ordered.
What is one thing that is more clear to you on hash tables now	Situations where a hash table would be a good tool to use.

[CheezItMan]

Thanks for getting this in. You hit the learning goals here Remember that building a hash does involve increasing space complexity.

[CheezItMan]

Since you're building a hash, the space complexity is O(n)

[CheezItMan]

What about the space complexity of the hash?