Which technique is used to handle collisions in a hash table?
A
Sorting
B
Chaining
C
Indexing
D
Compression
Correct Answer: Option B — Chaining
Explanation:
Chaining is a common technique for handling collisions in a hash table, where multiple elements that map to the same index are stored in a linked list at that position. This allows efficient storage even when hash values overlap.