Question 4097 – Hashing

→ Hash collisions are practically unavoidable when hashing a random subset of a large set of possible keys.
→ Two keys mapping to the same location in the hash table is called “Collision”.
Collision Resolving techniques
1. Separate chaining
2. Open addressing
i. Linear Probing
ii. Quadratic Probing
iii. Double hashing