Lecture Schedule:

 Tue 9/22         Introduction        

 Tue 9/24         Growth Rates (Handout 2,Solution )        

 Tue 9/29         Run Time of Recursion (Handout 3)    

 Thr 10/1         Abstract Data Types (ADTs) and Lists        

 Tue 10/6         Stacks and Queues        

 Thr 10/8         Priority Queues and Heaps        

 Tue 10/13         No Class

 Thr 10/15         Midterm Exam 1 (Study Sheet 1), (2008 Exam 1)

 Tue 10/20         Heapsort

 Thr 10/22         Mergesort and Quicksort

 Tue 10/27         Summary of sorting

 Thr 10/29         Trees

 Tue 11/3         Binary Search Trees

 Thr 11/5         Implementing BSTs

 Tue 11/10         Midterm 2 (Study Sheet 2, 2008 Exam 2))

 Thr 11/12         Tree Traversals

 Tue 11/17         Hashing and Hash Tables

 Thr 11/19         Graphs        

 Tue 11/24         No Class

 Thr 11/26         Thanksgiving        

 Tue 12/1         Topological Sort

 Thr 12/3         Shortest Path Algorithms - Dijstra's Algorithm

 Tue 12/8       1:00pm - 3:00pm        Final Exam - (Study Sheet for final exam, 2008 Final Exam )