Vidyalelo
Data Structure · Q2

Hashing

Programming · Data Structure · question 2

Q2

In hashing, what is a "collision"?

A.
When two elements are stored in the same slot.
B.
When a hash table exceeds its capacity.
C.
When a hash function fails to produce a unique index.
D.
When two keys hash to the same index.
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board