1. Hashing involves applying a hashing algorithm to a data item, known as the hashing key, to create a ____________
2. Hashing algorithms take a large range of values (such as all possible strings or all possible files) and map them onto a _______________________ (such as a 128 bit number).
3. Hashing is often compared to providing the 'best of both worlds', in this case, the best of the features of both:
4. Hashing has two main applications. Hashed values can be used to speed data retrieval, and can be used to ________________________
5. In the following example, a hashing value is produced using MOD in the hashing algorithm. What is 60 MOD 6?
6. The following excerpt summarises some rules for creating a good hash function. Which rule, if any, is incorrect?
7. The following shows the creation of a hash table to store scores. What number would go in the missing blanks?
8. Analyse the image below and select a statement from the options below that best describe what is happening.
9. What is one method for resolving the problem caused by collision?
10. Resolving collision can lead to ______________, and ____________ can be resolved by using an 'overflow'.
11. A good hash function would ideally have thousands, or even millions, of duplicate values.
12. Another resolution to collision is _________. This allows each slot to hold a reference to a collection (or chain) of items.
13. Ideally, a hashing algorithm should:
14. These are tables which can be searched for an item in O(1) time using a hash function to form an address from the key
15. This is a function which, when applied to the key, produces an integer which can be used as an address in a hash table.
16. These are collision sequences generated by addresses calculated with quadratic probing.
17. This is a function which, when applied to all the members of the set of items to be stored in a hash table, produces a unique set of integers within some suitable range.
18. This is the process of searching for another slot after a collision.
19. This is a simple re-hashing scheme in which the next slot in the table is checked on a collision.
20. What is the following excerpt describing?
21. The following excerpt describes how a hash value is stored in a table. Fill in the blanks
22. In re-hashing it is often necessary to create a larger hash table.
23. In re-hashing, each value in the existing table is inserted into the new table - in a position _______________________________
24. A dictionary (e.g. in Python) is a ____________________________________________
25. In the following example, showing a Python dictionary at work, what would the output be?