CS255 - Fall 2011: 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/23 Tue Introduction
08/25 Thu Algorithm Analysis Fundamentals
  • iteration
  • recursion
  • time complexity
2 08/30 Tue
09/01 Thu
3 09/06 Tue Brute Force
09/08 Thu
4 09/13 Tue Divide and Conquer
  • binary search
  • mergesort
  • quicksort
  • computational geometry
09/15 Thu
5 09/20 Tue
09/22 Thu
6 09/27 Tue Exam 1
09/29 Thu Decrease and Conquer
  • insertion sort
  • graphs
  • depth-/breadth-first search
7 10/04 Tue
10/06 Thu
8 10/11 Tue Transform and Conquer
  • pre-simplification
  • balanced trees
  • heaps / heapsort
10/13 Thu
9 10/18 Tue
10/20 Thu Sorting
10 10/25 Tue Hashing
10/27 Thu
11 11/01 Tue Exam 2
11/03 Thu Greedy Algorithms
  • Prim's algorithm
  • Kruskal's algorithm
  • Dijkstra's algorithm
12 11/08 Tue
11/10 Thu
13 11/15 Tue Dynamic Programming
11/17 Thu
14 11/22 Tue P and NP
11/24 Thu Thanksgiving
15 11/29 Tue P and NP (cont.)
12/01 Thu
16 12/09 Fri 10:15AM-12:15PM, Final Exam

Return to the syllabus