Skip to main content
About course

Before choosing course

Administrate About course

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

Choose semester and course offering

Choose semester and course offering to see information from the correct course syllabus and course offering.

* Retrieved from Course syllabus DD2440 (Autumn 2021–)

Content and learning outcomes

Course contents

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

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

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 Disposition

No information inserted

Literature and preparations

Specific prerequisites

  • Knowledge in algorithms and complexity, 7,5 credits, corresponding completed course DD1352/DD2350/DD2352.
  • Knowledge in discrete mathematics, 7,5 credits, corresponding to completed course SF1610/SF1662/SF1679/SF1688.

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.

Equipment

No information inserted

Literature

No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

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

Examination

  • ÖVN1 - Exercise, 6,0 hp, betygsskala: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Profile picture Danupon Na Nongkai

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web DD2440

Offered by

EECS/Computer Science

Main field of study

Computer Science and Engineering, Information Technology, Information and Communication Technology

Education cycle

Second cycle

Add-on studies

Please discuss with the instructor.

Contact

Danupon Na Nongkai (danupon@kth.se)

Supplementary information

In this course, the EECS code of honor applies, see:
http://www.kth.se/en/eecs/utbildning/hederskodex