If h is a simple uniform hashing function used to hash n keys into a table of…

PYQ IBPS SO CRP SPL-VII (2017)Modified — slightly modified from the official paper; see the solution

If h is a simple uniform hashing function used to hash n keys into a table of size M, where 3 ≤ n ≤ M, what is the tightest listed upper bound on the expected number of other keys colliding with a particular stored key x?

  1. A.

    less than 1

  2. B.

    less than n

  3. C.

    less than M

  4. D.

    less than n/2

  5. E.

    greater than n

Attempted by 54 students.

Sign up free to check your answer

Sign up free

Explore the full course: Ibps So It Mains

Loading lesson…