Design principles of algorithms and their application to computing problems. Topics include NP-completeness, analysis techniques, and main design principles including divide-and-conquer, dynamic programming, and branch-and-bound. Examples of advanced data structures and algorithmic approaches (like heuristics, approximation, and randomization) to solving hard computational problems.
Teacher: Pasi Fränti
Schedule: 34 h, starting from 10.9.
Monday 14-16 (D106)
Tuesday 14-16 (D106)
Schedule and Lecture Notes
Teachers:
Mikko Malinen (Joensuu)
Pekka Kilpeläinen (Kuopio)
Schedule: 16 h, starting from 14.9.
Friday: xx-xx (Joensuu: xxx, Kuopio: xxx)
Sufficient knowledge of Data structures and algorithms, and Mathematics.
Final exam:
x.10.: xxxxx
General exam 1: x.x. 12-16 M101
General exam 2: x.x. 12-16 M101
(See WebOodi for how to enter the general exams)
T. Cormen, C. Leiserson, and R. Rivest: Introduction to Algorithms, MIT Press, 1990.
P. Fränti, Introduction to Combinatoric Optimization Techniques, Lecture Notes, 2004. (Word)
Course page in Kuopio campus
To join the list send email to:
daa-tkt-lumet-subscribe@lists.uef.fi
To remove from the list send to:
daa-tkt-lumet-unsubscribe@lists.uef.fi