Date

Topic

Readings

Lab

Assignment due

Other

M 
Apr 3 
Class Outline, models of computing 




W 
5 
Design Recipe I 




F 
7 
Design Recipe II, mutation 




M 
10 
Lists 

Lab 1



W 
12 
Lists II 




F 
14 
Trees III 




M 
17 
Basic Running Time Model 




T 
18 


Lab 2



W 
19 
Basic Running Time Model II 


Assignment 1 due


F 
21 
List ADTs 




M 
24 
Binary Search Trees 




W 
26 
MIDTERM I 




Th 
27 


Lab 3



F 
28 
Binary Search Trees II 




M 
May 1 
Iterators for Traversals 




W 
3 
Iterators II 




F 
5 
Stacks 




M 
8 
Queues 


Assignment 2 due


W 
10 
Priority Queues 




F 
12 
Priority Queues II 

Lab 4



M 
15 
Sorting algorithms: Selection, Insertion Sort 




W 
17 
MIDTERM II 




F 
19 
Merge Sort 

Lab 5



M 
22 
Quicksort 




W 
24 
Hashing I 




F 
26 
Hashing II 

Lab 6



M 
29 
NO CLASS: MEMORIAL DAY 




W 
31 
Balanced Trees 


Assignment 3 due


F 
Jun 2 
Balanced Trees II 




M 
5 
Graphs 




W 
7 
Graphs 




F 
9 
Review 

Lab 7

Assignment 4 due

