Class |
Date |
Topic |
Text |
Notes |
1 |
M 8/31 |
Administrative, ADTs, Intro to OOD |
1, 3 |
|
2 |
W 9/2 |
Intro to C++, Complex Type/ADT/Class |
1, 3 |
|
|
M 9/7 |
Labor Day |
|
|
3 |
W 9/9 |
Constructors, overloading, member functions |
6.1-6.5 |
Proj1 assigned |
4 |
M 9/14 |
Reference variables, assignment operator |
8.3 |
HW 1 assigned |
5 |
W 9/16 |
I/O Streams, type conversion |
2.9, 6.5 |
|
6 |
M 9/21 |
String Class, destructors, memory management |
8.1-8.5 |
HW 1 due |
7 |
W 9/23 |
Introduction to Asymptotic Analysis |
4, 14.1, 14.2 |
|
|
Sun 9/27 |
|
|
Proj1 Due |
8 |
M 9/28 |
Lists, arrays, linked lists, templates |
7, 9 |
HW 2 assigned |
9 |
W 9/30 |
Iteration, assignment vs. copy, Stack ADT |
12.5 |
|
10 |
M 10/5 |
Stack Implementation |
5.1-5.3 |
HW 2 due |
11 |
W 10/7 |
Exam 1 |
|
Project 2 Assigned |
12 |
M 10/12 |
Queue Implementations |
5.4-5.7 |
|
13 |
W 10/14 |
Tree traversals, inheritance, virtual functions |
11.1-11.3, 12 |
|
14 |
M 10/19 |
Trees, inheritance examples |
11.1-11.3, 12 |
|
15 |
W 10/21 |
Binary Search Trees in C++ |
11.4-11.6 |
HW 3 assigned |
16 |
M 10/26 |
Operations on BST, asymptotic analysis |
11.4-11.6 |
|
|
Tu 10/27 |
|
|
Proj2 Due |
17 |
W 10/28 |
Splay trees |
Handouts |
Proj3 Assigned |
18 |
M 11/2 |
AVL trees |
13.5-13.6 |
HW 3 due |
19 |
W 11/4 |
More AVL Trees |
13.5-13.6 |
|
20 |
M 11/9 |
Red-Black Trees |
Handouts |
|
21 |
W 11/11 |
Exam 2 |
||
22 |
M 11/16 |
Graphs - operations, implementations |
13.8-13.9 |
|
|
Tu 11/17 |
|
|
Proj 3 Due |
23 |
W 11/18 |
Graphs - traversals, theorems |
Handouts |
Proj4 assigned |
24 |
M 11/23 |
More Graphs |
HW 4 Assigned | |
25 |
W 11/25 |
Spanning Trees, Shortest Path |
||
26 |
M 11/30 |
DAGs |
||
27 |
W 12/2 |
Heaps |
13.1-13.4 |
HW 4 Due |
28 |
M 12/7 |
Hashing |
14.3-14.7 |
|
29 |
W 12/9 |
Review for Final |
Proj4 Due |
|
30 |
M 12/14 |
Final Exam |
6:00 - 8:00 PM |
NOTE: Project dates are tentative. Syllabus subject to changed based on class progress
Last updated 21 September 1998 -- D. Frey