If several elements are competing for the same bucket in the hash table, what is it called?
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.
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.