Schedule:

Week 36: Mon (14-18) Tue (14-16): Complexity, Analysis tools, Turing-vs-RAM
Week 37: Mon (16-18) Tue (14-16): NP-completeness, analysis techniques
Week 38: Mon (14-18) Tue (14-16) Fri (12-14): Master theorem, Divide-and-Conquer, Greedy
Week 39: Mon (14-18): Dynamic programming, Branch-and-bound
Week 40: (no lectures this week)
Week 41: Mon (14-18): Heap structure, Approximation algorithms
Week 42: Mon (14-18) Tue (14-16) Fri (14-16): Randomized, local search and Genetic algorithms
Week 43: EXAM

Lecture Material:

Lectures material is partly available and has been prepared by mostly by students based on lecturer material in the class room or other sources available. Preparing more material for the missing part and improving the existing one is to be done during the course. Any new contributions will be credited as a part of the course work.

DAA-Intro.ppt
Asymptotic Bound.ppt
P, NP, NP-hard
Turing vs. RAM
SP to Coloring problem example
Knapsack to TSP
Closest pair problem
Shortest paths problem
Branch-and-bound
Divide-and-Conquer MST
Combinatoric optimization
Lecture Notes: Introduction to Combinatoric Optimization
Swarm Intelligence (TSP example)
GA for clustering
Lectures Notes of 2006 by Student

Supplementary material:

Video lecture about recursion
MIT Open Course lecture: Introduction to Algorithms
The Design of Approximation Algorithms (D.P.Williamson and D.B.Shmoys)
Millenium problem: P=NP ?
NP-complete problems
Minesweeper is NP-complete
Sieve of Erastothenes
Lecture Notes: Dynamic Programming
Sequence alignment: Pairwise and multiple
Optimointitehtävien ratkaiseminen