+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following technique stores data in the hash table itself in case of a collision?

(a) Open addressing

(b) Chaining using linked list

(c) Chaining using doubly linked list

(d) Chaining using binary tree

I want to ask this question from Hash Tables in division Hash Tables of Data Structures & Algorithms I

The question was asked in quiz.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) Open addressing

To explain: Open addressing is used to store data in the table itself in case of a collision. Whereas chaining stores data in a separate entity.

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.