| Homework | Reading | Due Date | Assignment |
|---|---|---|---|
| 0 | Ch. 1,2 | 1/24/2007 (but will not be collected) | Think about how you would finish the bridge example from class (p. 111, Programming Problem 2). |
| 1 | Ch. 3 | 1/31/2007 | Ch. 3 (pp. 164-170): Exercises 1, 4, 6, 11, 14, Write an iterative version of choose (hint: use a 2-D array), 25 |
| 2 | Ch. 4 | 2/7/2007 | Ch. 4 (pp. 215-219): Exercises 1, 4, 9, 12, 14, 18 |
| 3 | Ch. 4 | 2/14/2007 | html |
| 4 | Ch. 5 | 2/28/2007 | Ch. 5 (pp. 281-285): Self-Test 4; Exercises 1, 4 (do this as part of the linked list implementation), 7 (assume you are displaying the items by using the methods specified by the ADT, not as part of the implementation), 8, 10, 11 |
| Exam #1 Practice | Chs. 1-5 | 2/28/2007 (not to hand in) | Problems and Solutions |
| 5 | Sec. 6.1, 6.2, 10.1, 10.2 (pp. 477-485 only) | 3/28/2007 | Ch. 6 (pp. 318-321): Exercises 2, 3, 4, 7, 9, 10; Ch. 10 (pp. 512-515): Exercises 2, 3, 8, 23 (for insertion sort and selection sort) |
| Exam #2 Practice | Chs. 5,6,10 | 4/4/2007 (not to hand in) | Problems and Solutions |
| 6 | Ch. 7, 8, Sect. 10.2 (pp. 491-503 only) | 4/11/2007 | Ch. 7 (pp. 371-379): Exercises 1 (assume you have isEmpty but not size), 6 (using our implentation), 13, 14e; Ch. 8 (pp. 414-416): Exercises 3, 6, 8; Ch. 10 (pp. 512-515): Exercises 17, 20 |
| 7 | Sect. 11.1, 11.2 | 4/18/2007 | Ch. 11 (pp. 590-597): Exercises 1, 11, 12, 20ad, 29 (omit the comparison) |
| 8 | Ch. 11 | 4/25/2007 | Ch. 11 (pp. 590-597): Exercises 3, 6, 7, 9, 10, 30 |
| 9 | Ch. 12, Sect. 13.1 pp. 689-694 | 4/30/2007 | Ch. 12 (pp. 651-655): Exercises 3, 8, 9, 11, 13, 20; Ch. 13 (pp. 729-733): Exercise 1ae (stop after 2nd delete) |