Time - Denisse

[denisseai]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Because we need data to be found fast and without problems
How can you judge if a hash function is good or not?	It should be efficiently computable and it should distribute the keys uniformly
Is there a perfect hash function? If so what is it?	One that has no collisions
Describe a strategy to handle collisions in a hash table	One collision resolution strategy is using separate chaining
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Balanced BST would be preferred because of their lower computing cost when a table needs resizing
What is one thing that is more clear to you on hash tables now	There are more than 1 way to resolve collisions

[denisseai]

resources:

• https://www.geeksforgeeks.org/what-are-hash-functions-and-how-to-choose-a-good-hash-function/
• https://courses.cs.washington.edu/courses/cse373/18au/files/slides/lecture13.pdf
• https://www.geeksforgeeks.org/advantages-of-bst-over-hash-table/

[CheezItMan]

Overall well done. You do need more practice looking at things in terms of time/space complexity. It's ok to guess at the answers here and state your reasoning. I can give you feedback then.

[CheezItMan]

Time complexity 🤣

It's actually O(n) assuming the words are reasonably short O(n * mlog m) otherwise.

[CheezItMan]

Good that you cited your source. Time & space complexity?