Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Give a Java description of the values() and entries() methods that could
be included in the hash table implementation of Code Fragments 9.3–9.5.
R-9.11
Explain how to modify class HashTableMap given in Code Fragments 9.3–
9.5, so that it implements the dictionary ADT instead of the map ADT.
R-9.12
Show the result of rehashing the hash table shown in Figure 9.4 into a table of
size 19 using the new hash function h(k) = 2k mod 19.
R-9.13
Argue why a hash table is not suited to implement an ordered dictionary.
R-9.14
What is the worst-case time for putting n entries in an initially empty hash table,
with collisions resolved by chaining? What is the best case?
R-9.15
Draw an example skip list that results from performing the following series of
operations on the skip list shown in Figure 9.12: remove(38), insert(48,x),
insert(24,y), remove(55). Record your coin flips, as well.
R-9.16
Give a pseudo-code description of the remove operation in a skip list.
R-9.17
What is the expected running time of the methods for maintaining a maxima set
if we insert n pairs such that each pair has lower cost and performance than one
before it? What is contained in the ordered dictionary at the end of this series of
operations? What if each pair had a lower cost and higher performance than the
one before it?
R-9.18
Argue why location-aware entries are not really needed for a dictionary
implemented with a good hash table.
Creativity
C-9.1
576