1. Read the definition below to recap on Hash tables. What two simpler data structures do hash tables incorporate useful features from?
2. Look at the diagram below. What goes into the hash function, in this example, and what comes out?
3. The below example demonstrates a common problem that programmers will get when working with hash tables. What is it called?
4. Ideally, a good hash function would not allow too many duplicate values (collisions), as this could lead to 'clustering'. One way of resolving this however, is to use ______ for certain indexes.
5. _______ allows many items to exist at the same location in the hash table. When collisions happen, the item is still placed in the proper slot of the hash table. As more and more items hash to the same location, the difficulty of searching for the item i
6. Which of the following statements is true (regarding a good hash table)
7. Can you map the statements a - f below to their respective definitions?
8. Assume that a hash table has been used to implement a dictionary. The hashing algorithm that has been used is Catalogue Number MOD 100. What value is returned by the hashing function when it is applied to the catalogue number 1052?
9. The following description (from OCR exam board A level example) describes how a value is stored in a hash table. Fill in the blanks.
10. Which statement could be a description of rehashing (taken from the markscheme of the OCR Computing A Level exam board)