Which of the following technique is used for handling collisions in a hash table?
(a) Open addressing
(b) Hashing
(c) Searching
(d) Hash function
The origin of the question is Hash Tables in portion Hash Tables of Data Structures & Algorithms I
I had been asked this question during an interview.