Q10
In a hash table with linear probing, what happens if the desired slot is occupied?
A.
A new hash table is created.
B.
The next slot is checked sequentially.
AnswerC.
The element is placed in a new hash table.
D.
A new hash table is created.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board