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?
- A.
7
- B.
8
- C.
9
- D.
None of these
Attempted by 318 students.
Sign up free to check your answer
Sign up freeLoading lesson…

