Data Structures and Algorithms208010 marksHashing
Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.
Define hash table and hash function. What is collision in hashing? Explain linear probing and quadratic probing with suitable example.[10]
--- A hash table is a data structure that stores data in an array format, where each data item is placed at a specific position (index) calculated based on the value of the key. The data is stored in an array called a hash table, and the mapping of keys to indices is done so that equal keys map t...