notes keywords foldingin folding the identifier is partitioned into several parts all but the last part being of the same length hash functiona hash function is unary function that is used by hashed associative containers hashinghashing is the transformation of string of characters into usually shorter fixed-length value or key that represents the original string rehashingin rehashing find an alternative empty location by modifying the hash functionand applying the modified hash function to the colliding symbol self assessment fill in the blanks the simplest form of open hashing defines each slot in the hash table to be the head of is most appropriate when the hash table is kept in main memorywith the lists implemented by standard in-memory linked list resolution is the most important issue in hash table implementations hash function must be and stateless is referred to or accessed frequently either for adding the nameor for storing the attributes of the nameor for retrieving the attributes of the name hashing is method of directly computing the index of the table by using some suitable mathematical function called collision handling involve finding out an alternative location for one of the two colliding method ignores part of keyand use the remainder part directly as hash value review questions describe overflow chaining describe various hash functions in detail describe rehashing devise simpleeasy to calculate hash function for mapping three-letter words to integers between and - inclusive find the values of your function on the words pal lap pam map pat pet set sat tat bat for try for as few collisions as possible suppose that hash table contains hash_size entries indexed from through and that the following keys are to be mapped into the table (adetermine the hash addresses and find how many collisions occur when these keys are reduced by applying the operation hash_size lovely professional university