Suppose we are given \(n \) keys, \(m \) hash table slots, and two simple…

GATE · 2022 · CS · Computer Science & IT

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

A.
\(\frac{m}{n}\)
B.
\(\frac{n}{m}\)
C.
\(\frac{2n}{m}\)
D.
\(\frac{n}{2m}\)

Attempted by 613 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2