Hash Table Wrapup

Recall the division method:

h(k) = k mod m

Student exercise

Using the division method and chaining, insert the keys 4, 1, 3, 2, 0 into a hash table with table size 3 (m=3).

Solution:

0 -> [0,3]
1 -> [1,4]
2 -> [2]

Testing and Debugging

Go over the instructor tests for Segment Intersection Project.

Demonstrate a debugging and test creation session.