Date: Tuesday, February 17, 2009.
1. True or false:
2. Explain, step-by-step, how you will solve the Hanoi Tower problem for n=2 and
for n=3. No code is needed, just draw pictures.
- a vector can be of variable size;
- in contrast to arrays for which search requires writing a loop, search in a
vector can be performed by a single Java instruction, no loop is needed;
- enumeration types are described in Chapter 10;
- linked lists and graphs are described in Chapter 10.