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