Schedule

At the beginning and end of each class, I typically announce sections of the textbook covered in each class and those due at the next class. An approximate schedule appears in Figure 1. Please use it only as a rough guide to plan your studies. Do not use it to schedule travel or other events. If you need a definite answer on when something will or will not occur, you should check with me.


#	Date	Material
1	09-04	Introduction 1; trees; 18.0–18.3.
2	-06	Introduction 2; traversals; binary search trees; order statistics; 18.4–18.end., 19.0–19.2.
3	-11	Analysis of algorithms; maximum contiguous subsequence; 5.0–5.3.
4	-13	Static searching; further analysis; 5.4–5.end.
5	-18	BST analysis, AVL trees; 19.3–19.4.
6	-20	Red-black trees; AA-trees; 19.5–19.6.
7	-25	B-trees; disk data structures; catchup; 19.7–19.end.
8	-27	catchup; review.
9	10-02	Midterm Exam 1.
10	-04	Special tutorial.
	-09	No class (Fall break Oct. 6th–9th).
11	-11	Midterm discussion; AA-trees; 19.6.
12	-16	AA-trees; B-trees; 19.6, 19.8.
13	-18	B-tree; binary heaps; 19.8, 21.1–21.3.
14	-23	Splay trees; 22.1–22.2.
15	-25	Splay trees; 22.3–22.4.
16	-30	catch-up; review.
17	11-01	Midterm Exam 2.
18	-06	Midterm discussion; skew heaps 23.1.
19	-08	Pairing heap; 23.2.
20	-13	Hashing; 20.1–20.4.
21	-15	Hashing; 20.5–20.7.
22	-20	Graphs; shortest paths; 14.1–14.3.
	-22	No class (Thanksgiving break Nov. 21st–25th).
23	-27	Graphs; shortest paths...; 14.4–14.5.
24	-29	Sorting; 8.1–8.4.
25	12-04	Sorting; selection; 8.5–8.8.
26	-06	Special topic.
27	-11	Tutorial.
28	-13	Review.
29	12-20	Final Exam; 12:15 p.m.–2:15 p.m.; location TBA.

Figure 1:

Approximate Schedule. The numbers refer to sections in the textbook. Tuesday dates are in italics.