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

UGC NET 2004

Suppose we are implementing quadratic probing with a Hash function, Hash(y)=X mod 100. If an element with key 4594 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is:

  1. A.

    2

  2. B.

    3

  3. C.

    9

  4. D.

    97

Attempted by 16 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…