Consider the hash table of size 11 that uses open addressing with linear…
UGC NET 2022
Consider the hash table of size 11 that uses open addressing with linear probing. Let ℎ(𝑘) = 𝑘 mod 11 be the hash function. A sequence of records with keys 43,36,92,87.11.47.11,13,14 is inserted into an initially empty hash table, the bins of which are indexed from 0 to 10. What is the index of the bin into which the last record is inserted ?
- A.
8
- B.
7
- C.
10
- D.
4
Attempted by 172 students.
Sign up free to check your answer
Sign up freeLoading lesson…

