Calendar
Fall 2007
August
28 Introduction (ch. 1)
30 Generic Classes
September
4 Algorithm Analysis (ch. 2)
6
11
13
18 Lists, Stacks and Queues (ch. 3)
20
25
27
October
2 Trees and Heaps (ch. 4, ch. 6 p. 201-215)
4
FALL BREAK
16
18
23
25
30 Hashing (ch. 5)
November
1
6 Sorting (ch. 7)
8
13
15 The Union/Find Problem
THANKSGIVING BREAK
27 Graphs (ch. 9)
29
December
4 The MST Problem
6
11 Introduction to NP-Completeness (9.7)
13-16 Reading Days
17 All work must be submitted by 12 noon.