Time - Lola

[ubeninja77]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	a good hash function makes searching and inserting of elements efficient; distributing items to avoid collisions
How can you judge if a hash function is good or not?	minimizes collisions but would be able to effectively handle the collisions when they occur
Is there a perfect hash function? If so what is it?	no
Describe a strategy to handle collisions in a hash table	chaining items (linked lists) and/or liner probing
Describe a situation where a hash table wouldn't be as useful as a binary search tree	when you need to iterate through data in a set order or to find the max/min values
What is one thing that is more clear to you on hash tables now	ways a hash table can handle collisions and a more concrete understanding if hash table implementation (or at least i hope)