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

Think about how to extend the circular array implementation of the queue ADT
given in the previous chapter.)
C-6.10
Describe an efficient way of putting an array list representing a deck of n cards
into random order. You may use a function, randomInteger(n), which
returns a random number between 0 and n − 1, inclusive. Your method should
guarantee that every possible ordering is equally likely. What is the running
time of your method?
C-6.11
Describe a method for maintaining a favorites list L such that every element in L
has been accessed at least once in the last n accesses, where n is the size of L.
Your scheme should add only O(1) additional amortized time to each operation.
C-6.12
Suppose we have an n-element list L maintained according to the move-to-front
heuristic. Describe a sequence of n 2 accesses that is guaranteed to take Ω(n 3 )
time to perform on L.
C-6.13
Design a circular node list ADT that abstracts a circularly linked list in the -
same way that the node list ADT abstracts a doubly linked list.
C-6.14
Describe how to implement an iterator for a circularly linked list. Since
hasNext() will always return true in this case, describe how to perform
hasNewNext(), which returns true if and only if the next node in the list
has not previously had its element returned by this iterator.
C-6.15
Describe a scheme for creating list iterators that fail fast, that is, they all
become invalid as soon as the underlying list changes.
C-6.16
An array is sparse if most of its entries are null. A list L can be used to
implement such an array, A, efficiently. In particular, for each nonnull cell A[i],
we can store an entry (i, e) in L, where e is the element stored at A[i]. This
approach allows us to represent A using O(m) storage, where m is the number of
nonnull entries in A. Describe and analyze efficient ways of performing the
369