Question 13
Back to Exercise
A hash table resolves a collision by trying the next slot, then the next, until it finds a free one. What is this technique called?
- A Separate chaining
- B Open addressing (linear probing) Correct
- C Rehashing into a tree
- D Double buffering
Correct Answer: Option B
HashMap uses separate chaining instead; IdentityHashMap and ThreadLocal's map use linear probing.
Discussion & Comments 0
Share your method, a shortcut, or ask about a step you didn't follow.
No comments yet. Be the first to share your solution!