Computer Sciences > GATE 2023 > Data Structures
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?
A
Division method, i.e., use the hash function h(k) = k mod m.
B
Multiplication method, i.e., use the hash function h(k) = [m(kA - [kA])], where A is a carefully chosen constant.
C
Universal hashing method.
D
If k is a prime number, use Division method. Otherwise, use Multiplication method.

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science