This week there will be no program to work on for submission. There
will, however, be some written work to submit.
The written work (on paper):
- Examine the PermutationSeating2.java example in Module 4.
Write out the contents of the stack for the first test case
(where numSeats==3, numPeople==2). Show the state
of the stack at each iteration of the for-loop and each recursive call.
- Examine the Manhattan.java program and do the same.
That is, show the stack in detail for each recursive call.
Next you will need to spend some time preparing for the exam and
for presenting your in-class exercises. Thus, you will need to:
- Complete all in-class exercises so that you are current.
That is, by the start of every class, you will have completed
all in-class exercises for all material covered up to just
before that class.
- Read through most of the supplemental material (examples, not
exercises) and be familiar with it.