Down:
1. The idea behind separate _______ is to implement the array as a linked list called a chain.
3. The situation where the newly inserted key maps to an already occupied, and it must be handled using some _______ handling technology.
6. _________ is the process of increasing the size of a hashmap and redistributing the elements to new buckets based on their new hash values.
8. linear probing can be used to find the next available ______ to store the record.
10. Hashing is a technique or process of mapping _____ and values into the hash table by using a hash function
Across:
2. Index ______is a simple form of hashing where the data is directly mapped to an index in a hash table.
4. In ___________, all elements are stored in the hash table itself.
5. This __________ needs to be kept low, so that number of entries at one index is less and so is the complexity almost constant, i.e., O(1).
7. _______ is a data structure that maps keys to values using a special function called a hash function.
9. The hash function receives the input key and returns the ______of an element in an array called a hash table.