Course - Algorithm Construction - TDT4125
Algorithm Construction
Choose study yearAssessments and mandatory activities may be changed until September 20th.
About
About the course
Course content
Advanced algorithmic techniques, e.g. for solving and handling especially hard (e.g. NP-complete) problems.
Learning outcome
The candidate should have knowledge about advanced methods for algorithm construction, as well as underlying formalisms such as linear programming. The candidate should be able to construct efficient (possibly parameterized) exact or approximate algorithms to hard (e.g., NP-complete or online) problems.
Learning methods and activities
Lectures and individual exercises. Some of the lectures are given in English.
Compulsory assignments
- Exercises
Further on evaluation
If there is a re-sit examination, the examination form may change from written to oral.
The re-sit examination is held in August.
Recommended previous knowledge
TDT4120 Algorithms and Datastructures or equivalent.
Course materials
Given at the start of the course.
Credit reductions
Course code | Reduction | From |
---|---|---|
SIF8012 | 7.5 sp |
Subject areas
- Informatics
- Technological subjects