|
|
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
AA-trees;
§19.6. |
29th C10
B-trees;
disk
data
structures;
§19.7–19.end. |
|
|
October 4th C11
Catch-up;
review. |
6th C12
⋆ Midterm
Exam
1,
regular
class
time
&
place. |
|
|
11th
×No
class. Fall
break
Oct. 8th–11th. |
13th C13
AA-trees;
B-trees;
§19.6,19.8. |
|
|
18th C14
B-trees;
binary
heaps;
§19.8,21.1–21.3. |
20th C15
Splay
trees;
§22.1–22.2. |
|
|
25th C16
Splay
trees;
§22.3–22.4. |
27th C17
⋆ Quiz
2,
regular
class
time
&
place. |
|
|
November 1st C18
Skew
heaps
§23.1. |
3rd C19
Pairing
heap;
§23.2. |
|
|
8th C20
Hashing;
§20.1–20.4. |
10th C21
Hashing;
§20.5–20.7. |
|
|
15th C22
Catch-up;
review. |
17th C23
⋆ Midterm
Exam
2,
regular
class
time
&
place. |
|
|
22nd C24
Graphs;
shortest
paths;
§14.1–14.3. |
24th
×No
class. Thanksgiving
break
Nov. 23th–27th. |
|
|
29th C25
Graphs;
shortest
paths;
§14.4–14.5. |
December 1st C26
Sorting;
§8.1–8.4.
Term
project
submissions
due. |
|
|
6th C27
Sorting;
selection;
§8.5–8.8. |
8th C28
Catch-up;
review.
Journals
due. |
|
|
13th
×No
class. Finals
week
Dec.12th–16th. |
15th
×No
class. Finals
week
Dec.12th–16th. ⋆
Check
Univ. schedule
for
final
exam. |
|
|
|
|
|
|
|