Q44
How does double hashing work to resolve collisions in a hash table?
A.
By linking colliding elements in a list.
B.
By using a quadratic function to find a new slot.
C.
By probing linearly for the next open slot.
D.
By using a second hash function to compute a new index.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board