Hashtables 2 hashfunctions 3 collisions 4

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: h Tables Please revise: 1. Hash tables 2. Hash functions 3. Collisions 4. Probing functions 5. Load factors and their effect 6. Applications First, you should know how to construct a hash table and how to insert or delete keys from a hash table. Then, you should understand the loading factor and key distributions affect the performance of hash tables. For example, what happens when the keys are clustered together. And, by the way, what does “hashing” mean? 2. Graphs A lgorith m s Applications of BFS and DFS...
View Full Document

This note was uploaded on 04/08/2012 for the course COMP 305 taught by Professor George during the Spring '12 term at Hong Kong Polytechnic University.

Ask a homework question - tutors are online