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 ?
- A.
3
- B.
4
- C.
5
- 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 freeLoading lesson…

