CS255 - Fall 2010: Schedule

Weekly Schedule

This is a tentative schedule, and it is subject to change.
Refer to the course's Moodle for detailed, up-to-date assignments and reading suggestions.

WkDateTopic
1 08/24 Tue Introduction
08/26 Thu Algorithm Analysis Fundamentals
  • iteration
  • recursion
  • time complexity
2 08/31 Tue
09/02 Thu
3 09/07 Tue Brute Force
09/09 Thu
4 09/14 Tue Divide and Conquer
  • binary search
  • mergesort
  • quicksort
  • computational geometry
09/16 Thu
5 09/21 Tue
09/23 Thu
6 09/28 Tue Exam 1
09/30 Thu Decrease and Conquer
  • insertion sort
  • graphs
  • depth-/breadth-first search
7 10/05 Tue
10/07 Thu
8 10/12 Tue Transform and Conquer
  • pre-simplification
  • balanced trees
  • heaps / heapsort
10/14 Thu
9 10/19 Tue
10/21 Thu Sorting
10 10/26 Tue Hashing
10/28 Thu
11 11/02 Tue Exam 2
11/04 Thu Greedy Algorithms
  • Prim's algorithm
  • Kruskal's algorithm
  • Dijkstra's algorithm
12 11/09 Tue
11/11 Thu
13 11/16 Tue Dynamic Programming
11/18 Thu
14 11/23 Tue P and NP
11/25 Thu Thanksgiving
15 11/30 Tue P and NP (cont.)
12/02 Thu
16 12/08 Wed Final Exam, 8:00-10:00AM

Return to the syllabus