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.




September 2nd     C1

Introduction; trees §18.0–18.3.

4th     C2

Traversals; binary search trees; order statistics; §18.4–18.end.,19.0–19.2.



9th     C3

Analysis of algorithms; maximum contiguous subsequence; §5.0–5.3.

11th     C4

Static searching; further analysis; §5.4–5.end.



16th     C5

BST analysis, AVL trees; §19.3–19.4.

18th     C6

Red-black trees; §19.5.



23rd     C7

AA-trees; §19.6.

25th     C8

 Quiz 1, regular class time & place.



30th     C9

AA-trees; §19.6.

October 2nd     C10

B-trees; disk data structures; §19.7–19.end.



7th     C11

Review.

9th     C12

Special tutorial.



14th

 ×No class. Fall break Oct. 11th–14th.

16th     C13

 Midterm Exam 1, regular class time & place.



21st     C14

AA-trees; B-trees; §19.6,19.8.

23rd     C15

B-trees; binary heaps; §19.8,21.1–21.3.



28th     C16

Splay trees; §22.1–22.2.

30th     C17

Splay trees; §22.3–22.4.



November 4th     C18

Skew heaps §23.1.

6th     C19

 Quiz 2, regular class time & place.



11th     C20

Pairing heap; §23.2.

13th     C21

Hashing; §20.1–20.4.



18th     C22

Hashing; §20.5–20.7.

20th     C23

 Midterm Exam 2, regular class time & place.



25th     C24

Graphs; shortest paths; §14.1–14.3.

27th

 ×No class. Thanksgiving break Nov. 26th–30th.



December 2nd     C25

Graphs; shortest paths; §14.4–14.5.

4th     C26

Sorting; §8.1–8.4.



9th     C27

Sorting; selection; §8.5–8.8.

11th     C28

Review.



16th

 ×No class. Finals week Dec.15th–19th.

18th

 ×No class. Finals week Dec.15th–19th.
 Final exam: Dec. 18th 9:30–11:30 a.m.



Figure 1: Approximate schedule, likely to change.