CS 483
Analysis of Algorithms

Required Textbook: Jon Kleinberg and Eva Tardos: Algorithm Design

Schedule
Date Topic, Handouts Assignments/Due dates
week 1   Introduction and course logistics
  Stable Matching, (intro.pdf), (stable_matching.pdf)
  Chapt 1
week 2   Analysis Tools (analysis.pdf)   Chapt 2, Homework 1, Solution
week 3   Heaps (.pdf), Graphs (.pdf)   Chapt 2,3
week 4   Greedy Alg (.pdf), Dijkstra's example   Chapt 4 Homework 2 , Solutions
week 5   Minimum Weight Spanning Tree (.pdf), Prim's, Kruskal's examples   Chapt 4 Practice Problems
week 6,   Divide-Conquer, Merge-Sort, Counting Inversions (.pdf)   Chap 5 Homework 3 , Solutions
week 7   Dynamic Programming (start) (.pdf)   Chap 6 Quiz 2 solutions , Practice Problems
week 8   October 20th, Midterm Exam review
  practice midterm
week 9   Dynamic Prog., Weighted Intervals, Segmental LS (.pdf)
  Chap 6 Homework 4
week 10   Knapsack, Sequence Alignment
  Chap 6
week 11   Bellman Ford shortest path (.pdf)
  Chap 6, Chap 7
week 12   Bellman Ford Cont, Max Flow (.pdf) , max flow demo
  Chap 7 Homework 5
week 13   Max Flow Applications (.pdf) Intro to Intractability (.pdf)
  Chap 8
week 14   Intractability, NP complete problems (.pdf) , poly-reductions (.pdf)   Chap 8
week 15   Local Search, Approx. Alg. (.pdf)  
week 17   December 13th final exam, Review (.pdf)