Problem : How does a hash table allow for O(1) searching? What is the worst case efficiency of a look up in a hash table using separate chainging?
Problem : The bigger the ratio between the size of the hash table and the number of data elements, the less chance there is for collision. What is a drawback to making the hash table big enough so the chances of collision is ignorable?
Problem : How could a linked list and a hash table be combined to allow someone to run through the list from item to item while still maintaining the ability to access an individual element in O(1) time?
Problem : How could a hash table be used to implement a spell checker?
Problem : How long would a deletion operation take from hash table implemented using separate chaining?