+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following technique is used for handling collisions in a hash table?

(a) Open addressing

(b) Hashing

(c) Searching

(d) Hash function

The origin of the question is Hash Tables in portion Hash Tables of Data Structures & Algorithms I

I had been asked this question during an interview.

1 Answer

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

To explain: Open addressing is the technique which is used for handling collisions in a hash table. Separate chaining is another technique which is used for the same purpose.

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.