Consider a hash table 𝑃[0,1,…,10] that is initially empty. The hash table is…
GATE · 2026 · CS · Set 1 · Computer Science & IT
Consider a hash table 𝑃[0,1,…,10] that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is ℎ(𝑥)=(𝑥+7) mod 11.
Consider the following sequence of insertions performed on 𝑃:
1,13,22,15,11,24
Which of the following positions in the hash table is/are empty after these insertions are performed?
- A.
0
- B.
10
- C.
2
- D.
1
Attempted by 108 students.
Sign up free to check your answer
Sign up freeLoading lesson…