Tue 01/31	Introduction	Chap 1				
Thu 02/02	Memory & Processes	Chap 2				
Tue 02/07	Project 1					
Thu 02/09	Linked Lists vs Arrays	3.1 - 3.2				
Tue 02/14	Running Times	Chapter 4				
Thu 02/16	STL Stacks & Queues	"Chapter 5, 6"				
Tue 02/21	Circular Queues	3.4				
Thu 02/23	Project 2					
Tue 02/28	Trees	Chapter 7				
Thu 03/02	Binary Search Trees	10.1				
Tue 03/07	AVL Trees	10.2				
Thu 03/09	AVL Trees					
Tue 03/14	Midterm Review					
Thu 03/16	Midterm Exam 1					
Tue 03/21	Spring Break					
Thu 03/23	Spring Break					
Tue 03/28	Project 3 out					
Thu 03/30	Red-Black Trees	10.5				
Tue 04/04	Red-Black Trees					
Thu 04/06	Heaps	Chapter 8				
Tue 04/11	More Heaps					
Thu 04/13	Project 4					
Tue 04/18	Hash Tables	9.1-9.2				
Thu 04/20	Hash Tables					
Tue 04/25	Midterm Review					
Thu 04/27	Exam 2					
Tue 05/02	Project 5					
Thu 05/04	Sorting	11.1-11.3				
Tue 05/09	Average Running Time					
Thu 05/11	Disjoing Sets	11.4				
Tue 05/16	Final Exam Review