Consider a hash table of size 11 that uses open addressing with linear…
GATE · 2008 · IT
Consider a hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function used. A sequence of records with keys
43 36 92 87 11 4 71 13 14
is inserted into an initially empty hash table, the bins of which are indexed from zero to ten. What is the index of the bin into which the last record is inserted?
- A.
3
- B.
4
- C.
6
- D.
7
Attempted by 248 students.
Sign up free to check your answer
Sign up freeLoading lesson…