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

R-6.16
Describe how to create an iterator for a node list that returns every other
element in the list.
R-6.17
Suppose we are maintaining a collection C of elements such that, each time we
add a new element to the collection, we copy the contents of C into a new array
list of just the right size. What is the running time of adding n elements to an
initially empty collection C in this case?
R-6.18
Describe an implementation of the methods addLast and add Before
realized by using only methods in the set {isEmpty, checkPosition,
first, last, prev, next, addAfter, addFirst}.
R-6.19
Let L be maintained to be a list of n items ordered by decreasing access count.
Describe a series of O(n 2 ) accesses that will reverse L.
R-6.20
Let L be a list of n items maintained according to the move-to-front heuristic.
Describe a series of O(n) accesses that will reverse L.
Creativity
C-6.1
Give pseudo-code for the methods of a new class, ShrinkingArrayList,
that extends the class ArrayIndexList shown in Code Fragment 6.3 and
adds a method, shrinkToFit(), which replaces the underlying array with an
array whose capacity is exactly equal to the number of elements currently in the
array list.
C-6.2
Describe what changes need to be made to the extendable array implementation
given in Code Fragment 6.3 in order to shrink by half the size N of the array any
time the number of elements in the array list goes below N/4.
C-6.3
367