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