Problem : Augmenting our current implementation of the hash table, write a delete function to remove a string from the hash table.
Problem : To augment our current implementation, write a function that counts the number of strings stored in the hash table.
Problem : How would we augment our hash table such that it stores information on students? We'd still like to look up a student's name to find them, but we'd then immediately have access to information about them, such as a letter grade, their graduation year, etc.
Problem : If something happened to your code and you accidentally lost your hash function after having stored a lot of data in the hash table, how could you still search for a specific string? What would the search efficiency now be?
Problem : Linear probing is another method for collision avoidance. With linear probing, if a collision occurs, you sequentially look from the current place in the hashtable for the next open spot, and store the string there. What disadvantage does this method have for an insertion in terms of efficiency?