Roza - Cedar

[haset-19]

anagram, frequency functions

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	for optimal computation, we will achieve O(1) for insertion, search and delete
How can you judge if a hash function is good or not?	if it fulfills certain conditions: distributes keys uniformly, has quick look up, keys that are close will have values far apart
Is there a perfect hash function? If so what is it?	no, it is based on use case
Describe a strategy to handle collisions in a hash table	separate chaining, linear probing, quadratic probing, double hashing
Describe a situation where a hash table wouldn't be as useful as a binary search tree	when duplicate keys, and when ordered list
What is one thing that is more clear to you on hash tables now	we can solve a lot of problem with minimum time