COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
a collision in a hash table is ____
|
|
When 2 things have the same value
|
|
|
When 2 things are assigned the same address
|
|
|
When 2 things are processed at the same time
|
|
|
When 2 things are deleted at the same time
|
Explanation:
Detailed explanation-1: -Definition: A collision occurs when more than one value to be hashed by a particular hash function hash to the same slot in the table or data structure (hash table) being generated by the hash function.
Detailed explanation-2: -A collision occurs when two keys are hashed to the same index in a hash table. The reason for occurring collision is that every slot in hash table is supposed to store a single element.
Detailed explanation-3: -The situation where a newly inserted key maps to an already occupied slot in the hash table is called collision and must be handled using some collision handling technique.
Detailed explanation-4: -A collision occurs when two keys get mapped to the same index.
There is 1 question to complete.