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

Provide Java code fragments for the methods of the PositionList interface
of Code Fragment 6.5 that are not included in Code Fragments 6.9-6.11.
R-6.9
Describe a nonrecursive method for reversing a node list represented with a
doubly linked list using a single pass through the list (you may use the internal
node pointers).
R-6.10
Given the set of element {a, b, c, d, e, f} stored in a list, show the final state of
the list, assuming we use the move-to-front heuristic and access the elements
according to the following sequence: (a, b, c, d, e, f, a, c, f,b,d,e).
R-6.11
Suppose we are keeping track of access counts in a list L of n elements. Suppose
further that we have made kn total accesses to the elements in L, for some
integer k ≥ 1. What are the minimum and maximum number of elements that
have been accessed fewer than k times?
R-6.12
Give pseudo-code describing how to implement all the operations in the array
list ADT using an array in a circular fashion. What is the running time for each
of these methods?
R-6.13
Using the Sequence interface methods, describe a recursive method for
determining if a sequence S of n integers contains a given integer k. Your
method should not contain any loops. How much space does your method use in
addition to the space used for S?
R-6.14
Briefly describe how to perform a new sequence method makeFirst(p) that
moves an element of a sequence S at position p to be the first element in S while
keeping the relative ordering of the remaining elements in S unchanged. That is,
makeFirst(p) performs a move-to-front. Your method should run in O(1)
time if S is implemented with a doubly linked list.
R-6.15
Describe how to use an array list and an int field to implement an iterator.
Include pseudo-code fragments describing hasNext() and next().
366