GATEverse Practice, past papers & mock tests
GATE 2023 · CS - Forenoon
Programming & Data StructuresHashingmediumMCQ1 mark
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?
Save your progress

Related Programming & Data Structures PYQs