Design and Analysis of Algorithms
5
Algoritmit ja koneoppiminen
Syventävät opinnot
General design principles of algorithms. Examples of central problems and typical solutions. Average case analysis. Amortised complexity. Recurrences. NP-completeness. Prerequisites: the course Data Structures and Algorithms or equivalent.
Luennot
Aika | Huone | Luennoija | Päivämäärä |
---|---|---|---|
Ti 12-14 | C222 | Valentin Polishchuk | 07.09.2010-15.10.2010 |
Pe 12-14 | D122 | Valentin Polishchuk | 07.09.2010-15.10.2010 |
Harjoitusryhmät
Aika | Huone | Ohjaaja | Päivämäärä | Huomioitavaa |
---|---|---|---|---|
Ti 16-18 | C222 | Janne Korhonen | 13.09.2010—15.10.2010 |
Aika | Huone | Ohjaaja | Päivämäärä | Huomioitavaa |
---|---|---|---|---|
Ke 16-18 | BK107 | Janne Korhonen | 13.09.2010—15.10.2010 |
The lecture room for friday has changed!
Kurssin suorittaminen
Exam: locaiton and time TBA.
One handwritten two-sided A4 cheat-sheet is allowed on the exam (the cheat-sheet is returned with the exam).
Final grade: Up to 6 points can be earned in exercise sessions, and up to 54 points -- on the exam. For a grade of 1 you need to get at least 30 pts. For a grade of 5 -- more than 50 pts.
Exercise points: Exercise points are awarded based on the number of exercises done, as described in the following table:
0 - 8 -> 0 points 9 - 12 -> 1 point 13 - 16 -> 2 points 17 - 20 -> 3 points 21 - 25 -> 4 points 26 - 29 -> 5 points 30 - ∞ -> 6 points
Kirjallisuus ja materiaali
Prerequisite Data Structures courses: 2009, Spring 2010
Lectures (approximate plan; changes are possible)
Problem sets (approximate; changes are possible)
- Problem set 1
- Problem set 2. Compendium of NP-complete problems. A sister page at Wiki
- Problem set 3
- Problem set 4
- Problem set 5