Question 9495 – Hashing
November 21, 2023Question 11941 – Image-Processing
November 21, 2023Question 10672 – Hashing
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?
Correct Answer: D
Question 7 Explanation:
Hence, correct option is (D).
2
4
6
7
Subscribe
Login
0 Comments