What components does a hash table consist of?

A hash table consists of:

1. Array (or list): The main data structure where elements are stored. Sometimes called "buckets" or "slots".
2. Hash function: A function that takes a key as input and returns an index (integer) in the array. A good hash function ensures a uniform distribution of keys across the array, minimizing collisions.
3. Collision resolution mechanism: A method to resolve situations where the hash function generates the same index for different keys. Two main methods:
   • Separate Chaining: Each array element stores a pointer to a list (linked list, B-tree, etc.) of elements that hash to that index.
   • Open Addressing: When a collision occurs, another free space in the array is searched for placing the element. Different search strategies:
     • Linear Probing
     • Quadratic Probing
     • Double Hashing
4. Operations: Implementation of basic operations: insert, search, delete. These operations use the hash function to determine the location of elements in the array and the collision resolution mechanism if necessary.