At the beginning and end of each class, I typically announce the topics and textbook sections covered in that class and those due at the next class. It is important that students read the material before the class in which it is discussed and, in general, keep up with readings and studies. 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 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
⋆ Quiz 1, regular class time & place.
|
23rd C7
Red-black trees; §19.5.
|
25th C8
AA-trees; §19.6.
|
30th C9
B-trees; disk data structures; §19.7–19.end.
|
October 2nd C10
AA-trees; B-trees; §19.6,19.8.
|
7th C11
Catch-up; review.
|
9th C12
⋆ Midterm Exam 1, regular class time & place.
|
14th
×No class. Fall break Oct. 13th–14th.
|
16th C13
B-trees; binary heaps; §19.8,21.1–21.3.
|
21st C14
Splay trees; §22.1–22.2.
|
23rd C15
Splay trees; §22.3–22.4.
|
28th C16
Skew heaps §23.1.
|
30th C17
⋆ Quiz 2, regular class time & place.
|
November 4th C18
Pairing heap; §23.2.
|
6th C19
Hashing; §20.1–20.4.
|
11th C20
Hashing; §20.5–20.7.
|
13th C21
Catch-up; review.
|
18th C22
Graphs; shortest paths; §14.1–14.3.
|
20th C23
⋆ Midterm Exam 2, regular class time & place.
|
25th C24
Graphs; shortest paths; §14.4–14.5.
|
27th
×No class. Thanksgiving break Nov. 26st–Nov. 30th.
|
December 2nd C25
Sorting;
§8.1–8.4.
|
4th C26
Sorting; selection; §8.5–8.8.
|
9th C27
Catch-up;
review.
CS
education
week.
|
11th C28
CS
education
week.
|
16th
×No class. Finals week Dec.15th–19th.
|
18th
×No class. Finals week Dec.15th–19th.
|
|
|
|
|
|