IT-Universitetet i København
 
  Tilbage Kursusoversigt
Kursusbeskrivelse
Kursusnavn (dansk):Algorithm Design 
Kursusnavn (engelsk):Algorithm Design 
Semester:Efterår 2013 
Udbydes under:cand.it., softwareudvikling og -teknologi (sdt) 
Omfang i ECTS:7,50 
Kursussprog:Engelsk 
Kursushjemmeside:http://www.itu.dk/courses/SAD1/E2013/ 
Min. antal deltagere:12 
Forventet antal deltagere:50 
Maks. antal deltagere:100 
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).

This can be achieved, for example, by taking the courses "Foundations of Computing - Algorithms and Data Structures" or "Algorithms and Data Structures" (BADS). 
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, the student should able to:
  • Identify and formulate precisely (if possible) the algorithmic problem underlying in a given programming task.
  • Apply the following algorithmic techniques when solving a problem: Greedy, divide and conquer, dynamic programming, reduction to network flow.
  • Look up suitable NP hardness results in a compendium, and perform simple reductions from such problems to establish NP hardness.
 
Fagligt indhold:This course introduces 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 algorithms, divide and conquer, dynamic programming, network flow, reductions. 
Læringsaktiviteter:

Teaching consists of a mix of lectures and exercises.

Condensed course: The lectures will run in the first half of the semester week 35-41, at double pace.

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

---------------------------------------------------------
Information about study structure

For students on the SDT August 2012 curriculum:
This course is a mandatory backbone course for SDT-SE track.

This course is part of the SDT-DT track specializations Scalable Computing and Data Processing-

For students on SDT curricum before August 2012:

This course is part of the SDT-DT and SDT-SE track specializations Scalable Computing and Data Processing-
see the descriptions here:
SDT specializations

------------------------------------

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.

-------------------------------------
NB!! Course restriction!!

Please note that there is a course restriction between this course and the course Algorithm Design 15 ECTS and Advanced Algorithms.
That means that you cannot take this course, if you have already taken Algorithm Design 15 ECTS or Advanced Algorithms and that you cannot take Algorithm Design 15 ECTS or Advanced Algorithms if you take this course. 

Obligatoriske aktivititer:During this course students are required to hand in five mandatory assignments in the form of programming exercises that need to be completed and approved before being eligible to register for the examination. Failure to hand in these mandatory assignments on time will mean that the registration for examination is annulled. These mandatory assignments and their deadlines are announced on the course blog. 
Eksamensform og -beskrivelse:X: Eksperimentel eksamensform., 7-trins-skala, Ekstern prøve

4 timers skriftlig prøve med alle trykte hjælpemidler.
Der er ikke adgang til elektroniske kommunikationsredskaber såsom bærbar datamat eller læseplade med internet- eller anden netværks- forbindelse eller telefon.

Submission/completion of mandatory activities before xxx  

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

Afholdelse (tid og sted)
Kurset afholdes på følgende tid og sted:
Ugedag Tidspunkt Forelæsning/Øvelser Sted Lokale
Torsdag 12.00-13.50 Forelæsning ITU Aud 1
Torsdag 14.00-15.50 Øvelser ITU 3A18, 3A54

Eksamen afholdes på følgende tid og sted:
Eksamensdato Tidspunkt Eksamenstype Sted Lokale
2013-10-17 09:00-13:00 Se: Eksamensform - yderligere oplysninger ITU 2A12/2A14, 2A52 og 2A54
2013-10-17 09:00-13:00 Se: Eksamensform - yderligere oplysninger ITU Students first name from K to M - Room 2A54
2013-10-17 09:00-13:00 Se: Eksamensform - yderligere oplysninger ITU Students first name from N to T - Room 2A52
2013-10-17 09:00-13:00 Se: Eksamensform - yderligere oplysninger ITU Students first name from A to J - Room 2A12/2A14