Lecture 17 Objectives
At the end of today's class you should
KNOW:
- That a hash table is a data structure that provides constant (average)
behavior for searching on a key
- That the worst case behavior for search on a hash table is linear
- What constitutes a good hash function
- The definition of these terms as they relate to hash tables:
bucket, collision, load factor
BE ABLE TO:
- Show what would be stored in a hash table after a sequence of
insertions.
Sample Exam Question:
Describe what is meant by the term "collision" as it relates to hash tables.
Be precise.