Which of the following technique stores data in a separate entity in case of a collision?

Category: QuestionsWhich of the following technique stores data in a separate entity in case of a collision?
Editor">Editor Staff asked 4 weeks ago

Which of the following technique stores data in a separate entity in case of a collision?
 
(a) Open addressing
 
(b) Chaining using doubly linked list
 
(c) Linear probing
 
(d) Double hashing
 
This is a very interesting question from Hash Tables in portion Hash Tables of Data Structures & Algorithms I
 
I got this question during an online interview.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct answer is (b) Chaining using doubly linked list
 
Best explanation: Chaining using doubly linked list is used to store data in a separate entity (doubly linked list in this case) in case of a collision. Whereas open addressing stores it in the table itself.