Handle the collisions in hash tables

Question

Explain techniques use to handle the collisions in hash tables?

Answer 1

We can employ two major techniques to handle the collisions. They are separate chaining and open addressing. In separate chaining, each of array elements consists of a linked list. All of the data items hashing to a given array index are inserted into that list. In open addressing, data items which hash to a full array cell are placed in another cell in the array.