anil sharmalovely professional university unit hashing notes contents objectives introduction hashing linear probing or linear open addressing rehashing overflow chaining hash functions open hashing closed hashing rehashing summary keywords self assessment review questions further readings objectives after studying this unityou will be able toexplain the concept of hashing know of hash functions realise open hashing and closed hashing describe rehashing introduction the search time of each algorithm depend on the number of elements of the collection of the data searching technique called hashing or hash addressing which is essentially independent of the number hashing is the transformation of string of characters into usually shorter fixed-length value or key that represents the original string hashing is used to index and retrieve items in database because it is faster to find the item using the shorter hashed key than to find it using the original value it is also used in many encryption algorithms hash function is unary function that is used by hashed associative containersit maps its argument to result of type size_t hash function must be deterministic and stateless that isthe return value must depend only on the argumentand equal arguments must yield equal results lovely professional university