Leaves - Mariya

[M-Burr]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	It enables faster look-up times and reduces collusions
How can you judge if a hash function is good or not?	It should map different keys to different values & indexing should appear random. A good hash function should also be fast.
Is there a perfect hash function? If so what is it?	There is no perfect hash function.
Describe a strategy to handle collisions in a hash table	chaining with linked list
Describe a situation where a hash table wouldn't be as useful as a binary search tree	when elements need to be sorted
What is one thing that is more clear to you on hash tables now	how collusions are prevented