Consider a hash table of size 10 with indices \(\{0,1,\ldots,9\}\), with the…
PYQ GATE 2025
Consider a hash table of size 10 with indices , with the hash function , where linear probing is used to handle collisions. The hash table is initially empty and then the following sequence of keys is inserted into the hash table: 1, 4, 5, 6, 14, 15. The indices where the keys 14 and 15 are stored are, respectively
- A.
2 and 5
- B.
2 and 6
- C.
4 and 5
- D.
4 and 6
Attempted by 39 students.
Sign up free to check your answer
Sign up freeLoading lesson…

