Vidyalelo
Data Structure · Q31

Hashing

Programming · Data Structure · question 31

Q31

What is the purpose of a "hash collision resolution" technique?

A.
To balance a binary search tree.
B.
To sort elements in a hash table.
C.
To handle cases where multiple keys hash to the same index.
Answer
D.
To improve the speed of hash function computation.

Answer: Option C

Solution

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