notes the set of hash values (also called the buckets or binslet { }where is positive integer hash function hu associates buckets (hash valuesto keys two main issuescollisions if and are two different keysit is possible that ( ( this is called collision collision resolution is the most important issue in hash table implementations hash functions choosing hash function that minimizes the number of collisions and also hashes uniformly is another critical issue closed hashing all elements are stored in the hash table itself avoids pointersonly computes the sequence of slots to be examined collisions are handled by generating sequence of rehash values universe of primary keys probe number { given key xit has hash value ( , and set of rehash values ( ) ( , ) (xm- require that for every key xthe probe sequence be permutation of this ensures that every hash table position is eventually considered as slot for storing record with key value search (xtsearch will continue until you find the element (successful searchor an empty slot (unsuccessful searchdelete (xt no delete if the search is unsuccessful if the search is successfulthen put the label deleted (different from an empty slotinsert (xt no need to insert if the search is successful if the search is unsuccessfulinsert at the first position with deleted tag lovely professional university