Hashing, Dictionaries and Graphs

This explains hashing and hash tables. Hashing is next to magic: it allows us to the achieve O(1) lookup behaviour of an array for complex data types. We will emphasise an experimental approach to understand what makes a good hash function.

Presentation Slides

Tasks for week 4

• Activity Sheet 4 – Hashing and Graphs
• Given code for exercises
• Completed exercises
• Homework sheet

Programs are in a zipped file – download and extract then open with Idle

Back to course materials.