Lecture 26 Objectives
At the end of today's class you should
KNOW:
- How to initialize a hash table that uses open addressing
- How to resolve a collision in a hash table by using linear probing
- The big-O results for searching an open address hash table that resolves
collisions by using linear probing
BE ABLE TO:
- Show the contents of an open address hash table after several insertions and
removals have occurred, given the hash function for the table
Sample Exam Question:
Draw a hash table with open addressing and a size of 9. Use the hash
function "key%9". Insert the keys: 5, 29, 20, 0, 27 and 18 into your table
(in that order).