Data Structures, Algorithms, & Applications in C++
Chapter 5, Exercise 1

(a)

false

(b)

4

(c)

a, c, there is no element whose index is 6 and the ADT doesn't tell us what to do now, there is no element whose index is -3 and the ADT doesn't tell us what to do now.

(d)

0, 2, -1.

(e)

Assume that each operation is done on the initial list.

The list becomes (b,c,d) and a is returned.

The list becomes (a,b,d) and c is returned.

The list becomes (a,b,c) and d is returned.

(f) Assume that each operation is done on the initial list.

The list becomes (e,a,b,c,d).

The list becomes (a,b,f,c,d).

The list becomes (a,b,c,f,d).

The list becomes (a,b,c,d,f).

The remaining two are invalid operations.