SparkNotes Shopping Cart  |     |  Checkout
Brought to you by Barnes and Noble
Hash Tables
  
 
Problems
Problem 1.1: 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? [Solution]
Problem 1.2: 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? [Solution]
Problem 1.3: 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? [Solution]
Problem 1.4: How could a hash table be used to implement a spell checker? [Solution]
Problem 1.5: How long would a deletion operation take from hash table implemented using separate chaining? [Solution]
Help | Feedback | Make a request | Report an error | Send to a friend
 
For students sick of scribbling geometry concepts on index cards, SparkNotes Study Cards are the answer.
More...
 
SparkNotes Study Cards boil down Organic Chemistry into digestible tidbits, making studying easier.
More...
 
 
Go to top