Describe the all method to avoid collisions in hashing.
Ans- Open Addressing: In this technique a hash table with per-identified size is
considered. All items are stored in the hash table itself. In addition to the data, each hash
bucket also maintains the three states: EMPTY, OCCUPIED, DELETED. While inserting, if a
collision occurs, alternative cells are tried until an empty bucket is found. For which one of
the following techniques is adopted.
1.Liner Probing (this is prone to clustering of data + Some other constrains)
2.Quadratic probing
3.Double hashing
Chaining: Open Hashing, is a technique in which the data is not directly stored at the hash
key index (k) of the Hash table. Rather the data at the key index (k) in the hash table is a
pointer to the head of the data structure where the data is actually stored. In the most
simple and common implementations the data structure adopted for storing the element
is a linked-list.
