Design and Analysis of Algorithms

Main themes and learning objectives ยป
582630
5
Algorithms and machine learning
Advanced studies
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.
Year Semester Date Period Language In charge
2010 autumn 07.09-15.10. 1-1 English

Lectures

Time Room Lecturer Date
Tue 12-14 C222 Valentin Polishchuk 07.09.2010-15.10.2010
Fri 12-14 D122 Valentin Polishchuk 07.09.2010-15.10.2010

Exercise groups

Group: 1
Time Room Instructor Date Observe
Tue 16-18 C222 Janne Korhonen 13.09.2010—15.10.2010
Group: 2
Time Room Instructor Date Observe
Wed 16-18 BK107 Janne Korhonen 13.09.2010—15.10.2010

The lecture room for friday has changed!

Completing the course

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

Literature and material

Prerequisite Data Structures courses: 2009, Spring 2010

DAA at MIT OCW

TCS cheat sheet

Lectures (approximate plan; changes are possible)

Problem sets (approximate; changes are possible)