Date
|
Topic
|
Readings
|
Lab
|
Assignment due
|
Other
|
M |
Apr 3 |
Class Outline, notional machines |
|
|
|
|
W |
5 |
Design Recipe I |
|
|
|
|
F |
7 |
QUIZ, Design Recipe II, mutation |
|
|
|
|
M |
10 |
Lists |
|
Lab 1
|
|
|
W |
12 |
QUIZ, Lists II |
|
|
|
|
F |
14 |
Trees III |
|
|
|
|
M |
17 |
Basic Running Time Model |
|
|
A1 due
|
|
W |
19 |
QUIZ, Basic Running Time Model II |
|
|
|
|
F |
21 |
List ADTs |
|
Lab 2
|
|
|
M |
24 |
Running time, Arrays I |
|
|
|
|
W |
26 |
QUIZ, Templates for functions on Arrays and Lists |
|
|
|
|
F |
28 |
Stacks, Queues |
|
|
|
|
M |
May 1 |
Stacks, Queues |
|
Lab 3
|
|
|
W |
3 |
QUIZ, Stacks |
|
|
|
|
F |
5 |
Review of running time, Misc |
|
|
A2 due
|
|
M |
8 |
Binary Search Trees |
|
|
|
|
W |
10 |
Midterm Exam |
|
|
|
|
F |
12 |
Priority Queues II |
|
|
|
|
M |
15 |
Binary Search Trees |
|
Lab 4
|
|
|
W |
17 |
Hashing |
|
|
|
|
F |
19 |
Merge Sort |
|
|
|
|
M |
22 |
Quicksort |
|
|
|
|
W |
24 |
QUIZ, Hashing I |
|
|
|
|
F |
26 |
Hashing II |
|
|
|
|
M |
29 |
NO CLASS: MEMORIAL DAY |
|
|
|
|
W |
31 |
Balanced Trees |
|
|
|
|
F |
Jun 2 |
Balanced Trees II |
|
|
A3 due
|
|
M |
5 |
Graphs |
|
|
|
|
W |
7 |
Graphs |
|
|
|
|
F |
9 |
Review |
|
|
A4 due
|
|