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.

Correct : c

Similar Questions

Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap?
#950 MCQ
Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be...
#951 MCQ
Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation EXTRACT-MAX(A) extracts and...
#981 MCQ

Related Topics

hashing strategy hash table collisions malicious adversary universal hashing GATE Computer Sciences 2023 GATE CS 2023 Q25 data structures hashing

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: