GATE | CS 2022 | Question 16

Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h₁ and h₂. Further, suppose our hashing scheme uses h₁ for the odd keys and h₂ for the even keys. What is the expected number of keys in a slot? 

(A)

(B)

(C)

(D)

Answer:(B)
Explanation:

For a uniform hash function, regardless of the number of hash functions, the anticipated number of keys in a slot is always computed as (number of keys)/(number of slots). So, option B is the correct answer. 

Quiz of this Question
Please comment below if you find anything wrong in the above post