4.2.6 Hash tables

 To meet this assessment criteria you should be able to:

• Be familiar with the concept of a hash table and its uses. A hash table is a data structure that creates a mapping between keys and values.

• Be able to apply simple hashing algorithms.

• Know what is meant by a collision and how collisions are handled using rehashing. A collision occurs when two key values compute the same hash.

Resources on Isaac Computer Science