Leaves - Bri

[brilatimer]

Anagram and top k element

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Fast lookup ability, avoid collisions
How can you judge if a hash function is good or not?	Use of constant time
Is there a perfect hash function? If so what is it?	Not possible to have a perfect hash function due to the chance of key collision
Describe a strategy to handle collisions in a hash table	Possibly by using a chaining method (by storing a linked list for each value for a particular key)
Describe a situation where a hash table wouldn't be as useful as a binary search tree	BST is o(logn) time and has a faster lookup time for finding a value. (Hash table is o(n)).
What is one thing that is more clear to you on hash tables now	Hash tables seem like the optimal way to count frequencies, compared to other algorithms.