CS 223A -- Data Structures and Algorithm Analysis -- Fall 2006
Handouts (most recent toward top):
Homework Assignments:
| Number | Problems | Due Date |
| Hwk #1 | Chap 0: #4, 6, 8 (if possible); Chap 1: #1, 2, 3, 4 | 9/8/06 |
| Hwk #2 | Chap 1: #6, 7; Chap 2: #1, 2, 3, 4 | 9/15/06 |
| Hwk #3 | Chap 3: #1, 2, 3, 6, 8, 10, 18 | 9/22/06 |
| Hwk #4 | #4.1, 4.2, 4.4, 4.16, 4.20, 4.21, 4.22 (include O time complexity analysis), 4.23, 4.24, 4.26, 4.32 Plus: Write a class named Palindrome to recursively solve the palindrome problem. |
10/3/06 |
| Hwk #5 | Chap 5: p.133 problems #2, 3, 4, 5, 6, 8, 13, 16 | 10/6/06 |
| Hwk #6 | p.161 #7.2 (Eclipse), 7.4 (Eclipse), 7.6 (Eclipse) p.201 #8.4 (Eclipse), 8.6, 8.9, 8.10, 8.15, 8.16 |
10/25/06 |
| Hwk #7 | p.233 #9.1, 9.2, 9.3, 9.4, 9.5, 9.7 p.261 Chapter 10 #1-6, 9, 10, 11, 13 Plus: 2 programs (QueueList, DEQueue) -- see handout |
11/03/06 |
| Hwk #8 | p.298 Chapter 11 #1, 2, 3, 10, 20, 25 Plus: ExpressionTree program -- see handout |
11/17/06 |
| Hwk #9 | Chap 12 #1, 2, 12, 13, 14, 21 Chap 13 #4, 5, 8, 11 Plus: ComparatorHeap program, People class program -- see handout |
11/29/06 |