CS3851 -- Tentative Schedule

Week Period Topics Reading Lab
1
09/03-09/07		 Lecture 1 Course Introduction   Lab 1: Searching
Lecture 2 Algorithm Analysis video, 3-50
Lecture 3 Mathematical Toolbox video, 51-61, 1058-1069
2
09/10-09/14		 Lecture 1 Examples  
Lecture 2 Recursion and Induction
Execution time		 video, 62-75
Lecture 3 Examples  
3
09/17-09/21		 Lecture 1 Sorting -- Heapsort 123-144 Lab 2: Sorting
Lecture 2 Sorting -- Quicksort 145-164
Lecture 3 Sorting -- Misc. 165-182
4
09/24-09/28		 Lecture 1 Examples  
Lecture 2 Order Statistics 183-195
Lecture 3 Greedy Algorithms 370-392
5
10/01-10/05		 Lecture 1 Review   Lab 3: Compressing
Lecture 2 Midterm Exam  
Lecture 3 Graphs, BFS, DFS 525-560
6
10/08-10/12		 Lecture 1 Kruskal, Prim, Dijkstra 561-606
Lecture 2 Examples  
Lecture 3 Work on Presentation  
7
10/15-10/19		 Lecture 1 Graph Applications  
Lecture 2 Dynamic Programming 323-354
Lecture 3 Work on Presentation  
8
10/22-10/26		 Lecture 1 NP Complete 966-983 Lab 4: Roll your own
Lecture 2 NP Complete cont... 984-994, 1003-1018
Lecture 3 Examples  
9
10/29-11/02		 Lecture 1 Examples/Review  
Lecture 2 Work on Presentation  
Lecture 3 Student Presentation  
10
11/05-11/09		 Lecture 1 Student Presentation  
Lecture 2 Student Presentation  
Lecture 3 Student Presentation  
11
11/13		 Tuesday, 8am in S107 Final Exam
  • © 2001-2009 Dr. Christopher C. Taylor •
  • Office: L-343 •
  • Phone: 277-7339 •
  • npǝ˙ǝosɯ@ɹolʎɐʇ