Hash Table is an array of fixed size that contain keys with no ordering info.
Hash Table could be used in:
Separate Chaining is a #collision resolution strategy for 202112122035 by keeping a 202110191710 of all elements that hased into the same value.
Rehashing is a method for #202112122035 to resize the original Table into a bigger one, usually twice as large. This is usually used alongside with #202112131222
Open Addressing is a #collition resolution strategy for 202112122035 where alternative cells are tried until an empty cell is found.
Load Factor is a statistic for #202112122035 to determine how full is it.
Hash Function, denoted as \(h = H(M)\), is an unkey function that condense arbitrary lengths of value into a fixed size output (fingerprint). It could be used as a mapping function of #Hash Table key into an appropriate cell, in #Digital Signature for authentication#, creating one-way password, detecting intrusion or virus, or construct pseudorandom# function (PRF) or a pseudorandom number generator (PRNG).
Sometimes vertices could have their own names which is not ideal to be used for indexing. We could use 202112122035 to assign those names to an associated number.
Extendible Hashing is a #collision resolution strategy for 202112122035 that is similar to #202112121935.
Double Hashing is a strategy for #202112131222 that use two hash function instead of one to search an empty cell in the 202112122035.
Map is constructed as a 202112122035. It allows only random access by referring to the key stored in it.