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 |
August 30th C1
Introduction; trees §18.0–18.3.
|
September 1st C2
Traversals; binary search trees; order statistics; §18.4–18.end.,19.0–19.2.
|
6th C3
Analysis of algorithms; maximum contiguous subsequence; §5.0–5.3.
|
8th C4
Static searching; further analysis; §5.4–5.end.
|
13th C5
BST analysis, AVL trees; §19.3–19.4.
|
15th C6
⋆ Quiz 1, regular class time & place.
|
20th C7
Red-black trees; §19.5.
|
22nd C8
AA-trees; §19.6.
|
27th C9
B-trees; disk data structures; §19.7–19.end.
|
29th C10
AA-trees; B-trees; §19.6,19.8.
|
October 4th C11
Catch-up; review.
|
6th C12
⋆ Midterm Exam 1, regular class time & place.
|
11th
×No class. Fall break Oct. 10th–11th.
|
13th C13
B-trees; binary heaps; §19.8,21.1–21.3.
|
18th C14
Splay trees; §22.1–22.2.
|
20th C15
Splay trees; §22.3–22.4.
|
25th C16
Skew heaps §23.1.
|
27th C17
⋆ Quiz 2, regular class time & place.
|
November 1st C18
Splay trees.
|
3rd C19
Pairing heap; §23.2.
|
8th C20
Sorting;
§8.1–8.4.
|
10th C21
Sorting; selection; §8.5–8.8.
|
15th C22
Catch-up; review.
|
17th C23
⋆ Midterm Exam 2, regular class time & place.
|
22nd C24
Graphs; shortest paths; §14.4–14.5.
|
24th
×No class. Thanksgiving break Nov. 23th–Nov. 27th.
|
29th C25
Graphs; shortest paths; §14.1–14.3. Term project submissions due.
|
December 1st C26
Synthesis.
|
6th C27
Catch-up;
review.
CS
education
week
Dec. 5–11.
|
8th C28
CS education week.
|
13th
×No
class. Finals
week
Dec. 12th–16th.
|
15th
×No
class. Finals
week
Dec. 12th–16th.
|
|
|
|
|
|