Word Matching Exercise

Hash Function

Collision

Linear Probing

Quadratic Probing

Double Hashing

Separate Chaining

Load Factor

Rehash

	finds the next available location quadratically when a collision occurs.
	maps a key to an index in a hash table.
	is to reinsert the elements into the table after the hash table is resized.
	is the ratio between the number of elements and the hash table size.
	places all entries with the same hash index in the same location using a list storage.
	finds the next available location sequentially when a collision occurs.
	occurs when two keys are mapped to the same index.
	uses a secondary hashing function along with the primary hash function to find an available location for a key when a collision occurs.