På Svenska

DD2440 Advanced Algorithms 6.0 credits

Avancerade algoritmer

Advanced course focusing on areas on the border between computer science and discrete mathematics and covering modern techniques for construction of efficient algorithms.

  • Education cycle

    Second cycle

  • Main field of study

    Computer Science and Engineering
    Information Technology
    Information and Communication Technology

  • Grading scale

    A, B, C, D, E, FX, F

Course offerings

Autumn 19 avalg19 for programme students

Autumn 18 avalg18 for programme students

Autumn 18 SAP for Study Abroad Programme (SAP)

  • Periods

    Autumn 18 P1 (1.5 credits), P2 (4.5 credits)

  • Application code

    10068

  • Start date

    17/09/2018

  • End date

    14/01/2019

  • Language of instruction

    English

  • Campus

    KTH Campus

  • Tutoring time

    Daytime

  • Form of study

    Normal

  • Number of places

    No limitation

  • Schedule

    Schedule (new window)

  • Course responsible

    Danupon Na Nongkai <danupon@kth.se>

  • Target group

    Only open for students within the SAP-programme.

Intended learning outcomes

After passing the course, the student should be able to

  • explain different advanced algorithmic concepts such as randomized algorithms, approximation algorithms, fixed-parameter algorithms
  • analyze, select, use, and verify algorithms that are based on the above concepts,
  • develop efficient algorithms that are based on the above concepts,
  • independently explore existing advanced algorithms, implement them, and improve them using heuristics,
  • communicate algorithmic ideas in a clear, formal way

in order to

  • construct and evaluate computer programs that use computer resources efficiently.

Course main content

The course will describe and analyze a number of algorithms for combinatorial computational problems.

Algorithmic concepts: Randomized algorithms, approximation algorithms, fixed-parameter algorithms.

Eligibility

Algorithms and complexity corresponding to one of the courses DD1352, DD2350, DD2352.

Recommended prerequisites

5B1204/SF1631 Discrete Mathematics and one of the courses 2D1352/DD1352 Algorithms, Data Structures, and Complexity and 2D1354/DD2354 Algorithms and Complexity or the equivalent.

Literature

Will be announced at least 4 weeks before the start of the course on the course web.

Examination

  • ÖVN1 - Exercise, 6.0, grading scale: A, B, C, D, E, FX, F

In this course, the code of honor of the school is applied, see: http://www.kth.se/en/csc/utbildning/hederskodex

Offered by

EECS/Computer Science

Contact

Danupon Na Nongkai (danupon@kth.se)

Examiner

Danupon Na Nongkai <danupon@kth.se>

Add-on studies

Please discuss with the instructor.

Version

Course syllabus valid from: Spring 2019.
Examination information valid from: Spring 2019.