Hash Tables
A hash table is a data structure in which every entry is mapped into an index in an Array according to that entry’s hash value. Since a hash function might output value of a big-range, creating an array of that size may be undesirable. so the hash values are compressed. This compression might lead to hash collision so Hash Collision Handling must be implemented.