IT-Universitetet i København
  Tilbage Kursusoversigt
Kursusnavn (dansk):Avanceret algoritmik 
Kursusnavn (engelsk):Advanced Algorithms 
Semester:Efterår 2009 
Udbydes, softwareudvikling og -teknologi (sdt) 
Omfang i ECTS:15,00 
Min. antal deltagere:
Forventet antal deltagere:
Maks. antal deltagere:40 
Formelle forudsætninger:Before the course, the student should be able to:
  • Perform basic analysis of algorithm correctness and complexity, using invariants and big-O notation.
  • Use basic algorithms and data structures when programming (e.g., lists, queues, stacks, search trees, hashing, sorting algorithms, and basic graph algorithms).
  • Recognize a proof that a problem is NP-hard.
  • Formulate computational problems using propositional logic, constraints, and optimization goals.

This can be achieved, for example, by taking the courses "Performance and Test" and "Efficient AI Programming". 
Læringsmål: After the course, the student should be able to solve a wide range of real-life programming problems in a scalable way, by employing algorithmic design techniques and tools. In particular, you should be able to:
  • Identify and formulate precisely (if possible) the algorithmic problem hidden in a given programming task.
  • Apply the following algorithmic techniques when solving a problem: Greedy, divide and conquer, dynamic programming, reduction to network flow.
  • Theoretically analyze the performance of a given algorithmic solution, including the analysis of basic approximation algorithms and basic randomized algorithms.
  • Look up suitable NP hardness results in a compendium, and perform simple reductions from such problems to establish NP hardness.
  • At a basic level, evaluate theoretically the performance of an algorithm in a parallel or distributed setting, and in situations where there is a massive amount of data.
  • Find results in the algorithms research literature relevant to a given problem.
Fagligt indhold:This course will introduce students to techniques for solving complex programming tasks arising in modern IT systems. Focus in the course is on algorithm design and identification of computationally hard problems. The course contains both theoretical and analysis and implementation exercises.

Contents of lectures includes: Formulating an algorithmic problem, greedy algorithms, graph exploration, divide and conquer, dynamic programming, network flow, reductions, approximation algorithms, randomized algorithms, and architectures. 
Læringsaktiviteter:14 ugers undervisning bestående af forelæsninger og øvelser

Teaching consists of a mix of lectures and exercises.

The exam is written; a number of mandatory assignments must be approved to qualify for the exam.

Information about study structure

This course is part of the SDT specialization Scalable Computing - see the description here:
SDT specializations
In order to graduate as a MSc in SDT, you need to pass the SDT backbone courses, and also take a 22,5 ECTS specialization and two 7,5 ECTS electives.


Se hvordan undervisningen er tilrettelagt her:
link til skemaoplysninger
Skemaoplysningerne vil være tilgængelige fra kort før semesterstart.

See the schedule here:
link to the time table
The schedule will be available shortly before the beginning of the term.


Eksamensform og -beskrivelse:D. submission of written work with following oral (7-scale; external exam), 7-trins-skala, Ekstern censur


Litteratur udover forskningsartikler:Algorithm Design, by Eva Tardos and Jon Kleinberg, Addison-Wesley, 2005. ISBN-10: 0321372913, ISBN-13: 978-0321372918. 
Følgende personer underviser på kurset:
Navn Stilling Undervisertype Indsats (%)
Thore Husfeldt Lektor(ITU) Kursusansvarlig 100

Afholdelse (tid og sted)
Kurset afholdes på følgende tid og sted:
Ugedag Tidspunkt Forelæsning/Øvelser Sted Lokale
Mandag 10.00-12.00 Forelæsning ITU 2A18
Onsdag 10.00-12.00 Forelæsning ITU 2A12
Onsdag 13.00-15.00 Øvelser ITU 2A12

Eksamen afholdes på følgende tid og sted:
Eksamensdato Tidspunkt Eksamenstype Sted Lokale
2010-01-11 09.00-13.00 Skriftlig eksamen ITU 4A14/4A16