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.


Tuesday	Thursday


September 1st C1 Introduction; trees §18.0–18.3.	3rd C2 Traversals; binary search trees; order statistics; §18.4–18.end.,19.0–19.2.

8th C3 Analysis of algorithms; maximum contiguous subsequence; §5.0–5.3.	10th C4 Static searching; further analysis; §5.4–5.end.

15th C5 BST analysis, AVL trees; §19.3–19.4.	17th C6 ⋆ Quiz 1, regular class time & place.

22nd C7 Red-black trees; §19.5.	24th C8 AA-trees; §19.6.

29th C9 AA-trees; §19.6.	October 1st C10 B-trees; disk data structures; §19.7–19.end.

6th C11 ⋆ Midterm Exam 1, regular class time & place.	8th C12 Special tutorial.

13th ×No class. Fall break Oct. 10th–13th.	15th C13 AA-trees; B-trees; §19.6,19.8.

20th C14 B-trees; binary heaps; §19.8,21.1–21.3.	22nd C15 Splay trees; §22.1–22.2.

27th C16 Splay trees; §22.3–22.4.	29th C17 ⋆ Quiz 2, regular class time & place.

November 3rd C18 Skew heaps §23.1.	5th C19 Pairing heap; §23.2.

10th C20 Hashing; §20.1–20.4.	12th C21 Hashing; §20.5–20.7.

17th C22 ⋆ Midterm Exam 2, regular class time & place.	19th C23 Graphs; shortest paths; §14.1–14.3.

24th C24 Graphs; shortest paths; §14.4–14.5.	26th ×No class. Thanksgiving break Nov. 25th–29th.

December 1st C25 Sorting; §8.1–8.4.	3rd C26 Sorting; selection; §8.5–8.8.

8th C27 Review.	10th C28 Review.

15th ×No class. Finals week Dec.14th–18th.	17th ×No class. Finals week Dec.14th–18th. ⋆ Final exam will be as scheduled by the University.

Figure 1:

Approximate schedule, likely to change.