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