= CMPT405 Spring 2016 =
Instructor: Petra Berenbrink, [[mailto:[email protected]|[email protected]]], TASC1 8227\ TA: Chang Xu (Steve), [[mailto:[email protected]|[email protected]]],\ TA office hour: \ Monday 12:00 ~- 13:00 ASB 9814\ Friday 15:00 ~- 16:00 ASB 9814
== Textbook == Introduction to Algorithms
Hardcover – Jul 31 2009 by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein
== Outline ==
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms (shortest paths, spanning trees, flow)
- NP~-Completeness
- Approximation Algorithms
- Amortized Analysis
- Local Search or Algorithmic Game Theory
== Grading scheme ==
- 70% final
- 30% for 2 midterms
Please note that students have to pass the final to pass this course.
== Slides == [[ slide1 | Greedy Algorithms ]]\ [[ slide2 | Shortest Path ]]\ [[ slide3 | Minimum Spanning Tree ]]\ [[ slide4 | Network Flow ]]\ == Problems == [[ problem1 | Problem sheet 1]]\ [[ problem2 | Problem sheet 2]]\ [[ problem3 | Problem sheet 3]]\ [[ problem4 | Problem sheet 4]]\