Differance between Open addressing and chaining for collision resolution ?
In open addressing, proceeding from the occupied position specified by hash address the program checks the subsequent positions in order until an unused (empty) position is found.
Chaining: In this method various overflow locations are kept, commonly by extending the way with a number of overflow positions. In addition, a pointer field is added to each record location. A collision is resolved by placing the latest record in an unused overflow location and setting the pointer of occupied hash address location to the address of in which overflow location. A linked list of overflow records for every hash address is therefore maintained.