notes task "open hashing is most appropriate when the hash table is kept in main memorywith the lists implemented by standard in-memory linked list explain rehashing this is another method of collision handling in this method you find an alternative empty location by modifying the hash functionand applying the modified hash function to the colliding symbol for exampleif is symbol and (xiand if the ith location is already occupiedthen modify the hash function to and find out ( )if ( =jand jth location is emptythen accommodate in the jth location otherwise you once again modify to some and repeat the process till the collision gets handled once the collision gets handled we revert back to the original hash function before considering the next symbol denote ( by simply (xlinear probing (xi( (ximod quadratic probing (xi( (xc mod where and are constants double hashing (xi( (xi mod another hash function comparison of rehashing methods linear probing distinct probe sequences primary clustering quadratic probing distinct probe sequences no primary clusteringbut secondary clustering double probing distinct probe sequences no primary clustering no secondary clustering summary hash functions are mostly used in hash tablesto quickly locate data record (for examplea dictionary definitiongiven its search key (the headwordspecificallythe hash function is used to map the search key to the index of slot in the table where the corresponding record is supposedly stored rehashing schemes use second hashing operation when there is collision lovely professional university