+1 vote
in Data Structures & Algorithms I by (88.2k points)
If several elements are competing for the same bucket in the hash table, what is it called?

(a) Diffusion

(b) Replication

(c) Collision

(d) Duplication

I'm obligated to ask this question of Hash Tables in section Hash Tables of Data Structures & Algorithms I

This question was addressed to me by my school principal while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (c) Collision

Explanation: In a hash table, if sevaral elements are computing for the same bucket then there will be a clash among elements. This condition is called Collision. The Collision is reduced by adding elements to a linked list and head address of linked list is placed in hash table.

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.