|
|
Tuesday |
Thursday |
| |
|
|
August 31st C1
Introduction;
trees
§18.0–18.3. |
September 2nd C2
Traversals;
binary
search
trees;
order
statistics;
§18.4–18.end.,19.0–19.2. |
|
|
7th C3
Analysis
of
algorithms;
maximum
contiguous
subsequence;
§5.0–5.3. |
9th C4
Static
searching;
further
analysis;
§5.4–5.end. |
|
|
14th C5
BST
analysis,
AVL
trees;
§19.3–19.4. |
16th C6
Red-black
trees;
§19.5. |
|
|
21st C7
⋆ Quiz
1,
regular
class
time
&
place. |
23rd C8
AA-trees;
§19.6. |
|
|
28th C9
AA-trees;
§19.6. |
30th C10
B-trees;
disk
data
structures;
§19.7–19.end. |
|
|
October 5th C11
AA-trees;
B-trees;
§19.6,19.8. |
7th C12
⋆ Midterm
Exam
1,
regular
class
time
&
place. |
|
|
12th
×No
class. Fall
break
Oct. 9th–12th. |
14th C13
B-trees;
binary
heaps;
§19.8,21.1–21.3. |
|
|
19th C14
Splay
trees;
§22.1–22.2. |
21st C15
Splay
trees;
§22.3–22.4. |
|
|
26th C16
⋆ Quiz
2,
regular
class
time
&
place. |
28th C17
Skew
heaps
§23.1. |
|
|
November 2nd C18
Special
tutorial. |
4th C19
Pairing
heap;
§23.2. |
|
|
9th C20
Hashing;
§20.1–20.4. |
11th C21
Hashing;
§20.5–20.7. |
|
|
16th C22
⋆ Midterm
Exam
2,
regular
class
time
&
place. |
18th C23
Graphs;
shortest
paths;
§14.1–14.3. |
|
|
23rd C24
Graphs;
shortest
paths;
§14.4–14.5. |
25th
×No
class. Thanksgiving
break
Nov. 24th–28th. |
|
|
30th C25
Sorting;
§8.1–8.4. |
December 2nd C26
Sorting;
selection;
§8.5–8.8.
Term
projects
submissions
due. |
|
|
7th
×No
class. Project
presentations.
Extended
and
alternate
hours. |
9th C27
Review.
Journals
due. |
|
|
14th
×No
class. Finals
week
Dec.13th–17th. |
16th
×No
class. Finals
week
Dec.13th–17th. ⋆
Check
Univ. schedule
for
final
exam. |
|
|
|
|
|
|
|