Q36
How does linear probing handle collisions in a hash table?
A.
By chaining elements in a linked list.
B.
By searching sequentially for the next available slot.
AnswerC.
By quadratic probing.
D.
By chaining elements in a linked list.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board