This preview shows page 1. Sign up to view the full content.
Unformatted text preview: e 10.34 on page 213 of CLRS. 2 Handout 14: Problem Set 4 Exercise 44. Suppose we hash elements of a set U of keys into m slots. Show that if U  > (n  1)m, there is a subset of U of size n consisting of keys that all hash to the same slot, so that the worstcase searching time for hashing with chaining is (n). Exercise 45. Do exercise 11.33 on page 236 of CLRS. Problem 41. Comparisons among dynamic sets For each type of dynamic set in the following table, what is the asymptotic running time for each operation listed, in terms of the number of elements n? For operations that have not been explicitly defined, consider how you would implement the oper ation given the data structure. You do not need to give the algorithm, just the running time. State any assumptions that you make. Assume that the hash tables resolve collisions by chaining with doubly linked l...
View
Full
Document
This note was uploaded on 07/09/2009 for the course CSE 6.046J/18. taught by Professor Piotrindykandcharlese.leiserson during the Fall '04 term at MIT.
 Fall '04
 PiotrIndykandCharlesE.Leiserson
 Algorithms

Click to edit the document details