A hash table of size 10 uses open addressing with linear probing. Suppose the…

A hash table of size 10 uses open addressing with linear probing. Suppose the hash function is h(k) = k mod 10. We insert the following keys in order: 47, 57, 67, 77, 87. At which index will the key 87 be finally placed?

  1. A.

    7

  2. B.

    8

  3. C.

    9

  4. D.

    None of these

Attempted by 318 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…