Suppose we are implementing quadratic probing with a hash function Hash (X) =…

GSET 2021

Suppose we are implementing quadratic probing with a hash function Hash (X) = X mod 7. If the keys 14, 8, 21, 2 and 7 are to be inserted in that sequence in a table of size 7, then at which index position will key 7 be stored ?

  1. A.

    3

  2. B.

    4

  3. C.

    5

  4. D.

    Quadratic probing will not be able to find an empty slot

Attempted by 9 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…