Fire - Ida - Hash practice

[idago123]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Where quick lookup of items is important, a hash function could scale well and execute relatively quickly.
How can you judge if a hash function is good or not?	Good hash functions must be: consistent, map different keys to different values, execute in constant time, appear 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	Linear Probing - When inserting a new element into the hash table, the hash function will return an index number. if the bucket at that index number is occupied, the hash table checks the next element in the array until an empty bucket is found.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	if a dataset doesn't provide a unique key values.
What is one thing that is more clear to you on hash tables now	Collision

[CheezItMan]

Thanks for getting this in Ida. Take a look at my comments and let me know what questions you have. You had the right idea in both problems.