bild
Skolan för
elektroteknik
och datavetenskap

Avancerade algoritmer, fall 2006

The course is taught in Swedish but the textbook, handouts and homework will be in English. The first lecture will be on October 30 at 1 pm in room Q34. Welcome!

Teacher: Stefan Nilsson

The course material consists of lecture notes and copies of articles. Some of the contents of the course is also covered in the optional text book: Introduction to Algorithms, 2nd ed., by Cormen et al.

Examination

The course has two projects and four sets of homework.

The homeworks are done individually and handed in at the beginning of the homework sessions. You should be prepared to present your homework orally in class. This is part of the examination and you have to attend the homework session to get credit for your homework.

The projects are done in groups of two people. The group should hand in only one solution and for each problem it should be clearly marked which of the members have contributed. There will be a list outside of Stefan's office where you can book a time to pick up and discuss your project. All members of the group must be present during this oral examination.

Grades will be assigned as follows:

KTH:  U    0 - 149
      3  150 - 199
      4  200 - 249
      5  250 - 300

SU:   U    0 - 149
      G  150 - 224
     VG  225 - 300

Schedule

  • Mon 30/10 13-15 Q34, lecture 1.
  • Wed 1/11 10-12 L52, lecture 2.
  • Fri 3/11 15-17 E3, homework A.
  • Mon 6/11 13-15 Q34, lecture 3.
  • Wed 8/11 10-12 Q33, lecture 4.
  • Thu 9/11 10-12 Q2, homework B.
  • Mon 13/11 13-15 Q34, lecture 5.
  • Thu 16/11 10-12 E3, lecture 6.
  • Fri 17/11 15-17 E2, lecture 7, project 1.
  • Mon 20/11 13-15 Q34, lecture 8.
  • Thu 23/11 10-12 E3, homework C.
  • Mon 27/11 13-15 Q34, lecture 9.
  • Wed 29/11 10-12 V22, lecture 10.
  • Fri 1/12 15-17 E2, homework D.
  • Tue 5/12 10-12 E3, lecture 11, project 2.

Copyright © Sidansvarig: Stefan Nilsson <snilsson@nada.kth.se>
Uppdaterad 2006-12-01