Question 11542 – AlgorithmsNovember 21, 2023
Question 9495 – HashingNovember 21, 2023
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let k be the number of keys, m be the number of slots in the hash table, and k>m. Which one of the following is the best hashing strategy to counteract the adversary?
Correct Answer: C