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

in memory, describe a method running in O(n logn) time (not O(n 2 ) time!) for
counting the number of 1's in A.
C-9.14
Describe an efficient dictionary structure for storing n entries that have an
associated set of r < n keys that comes from a total order. That is, the set of keys
is smaller than the number of entries. Your structure should perform operation
find All in O(logr + s) expected time, where s is the number of entries
returned, operation entries() in O(n) time, and the remaining operations of
the dictionary ADT in O(logr) expected time.
C-9.15
Describe an efficient dictionary structure for storing n entries whose r < n keys
have distinct hash codes. Your structure should perform operation findAll in
O(1 + s) expected time, where s is the number of entries returned, operation
entries() in O(n) time, and the remaining operations of the dictionary ADT
in O(1) expected time.
C-9.16
Describe an efficient data structure for implementing the bag ADT, which
supports a method add(e), for adding an element e to the bag, and a method
remove(), which removes an arbitrary element in the bag. Show that both of
these methods can be done in O(1) time.
C-9.17
Describe how to modify the skip list data structure to support the method
atIndex(i), which returns the position of the element in the "bottom" list S 0 at
index i, for i [0, n − 1]. Show that your implementation of this method runs in
O(logn) expected time.
Projects
P-9.1
Implement a class that implements the dictionary ADT by adapting the
java.util.HashMap class.
P-9.2
Implement the map ADT with a hash table with separate chaining collision
handling (do not adapt any java.util classes).
P-9.3
579