Computer Science 332
Analysis of Algorithms

Dickinson College
Fall Semester 2003
Grant Braught

General Course Information

Course Schedule

[ September | October | November | December ]

September:

MondayThursday
9/1 Introduction
1234
9/4 Problems and Applications
1234
9/8 Data Structures
1234
9/11 Asymptotic Notation
1234
9/15 Non-Recursive Algorithm Analysis 1
1234
9/18 Non-Recursive Algorithm Analysis 2
1234
9/22 Recursive Algorithm Analysis
1234
9/25 Brute Force Algorithms
1234
9/29 String Matching & Convex Hull
1234
1234


October:

MondayThursday
1234 10/2 Midterm Exam #1
1234
10/6 Divide and Conquer
1234
10/9 Quick Sort
1234
10/13 Fall Pause
1234
10/16 Project Discussion & Assignment
1234
10/20 Decrease and Conquer
1234
10/23 Order Statistics
1234
10/27 Searching in Graphs
1234
10/30 Transform and Conquer
1234


November:

MondayThursday
11/3 AVL Trees
1234
11/6 Midterm Exam #2
1234
11/10 Time/Space Tradeoffs
1234
11/13 Greedy Algorithms
1234
11/17 Prim's Algorihtm
1234
11/20 Kruskal's Algorihtm
1234
11/24 Dijkstra's Algorihtm
1234
11/27 Thanksgiving Break
1234


December:

MondayThursday
12/1 NP Completeness
1234
12/4 Student Presentations
1234
12/8 Student Presentations
1234
12/11 Student Presentations
1234
Final Exam - Saturday 12/20 - 9:00 am