+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...