Course - Algorithm Construction - TDT4125
Algorithm Construction
Choose study yearAbout
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.
Recommended previous knowledge
Subject 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
Contact information
Course coordinator
Lecturers
Department with academic responsibility
Examination
Examination
Ordinary examination - Spring 2025
School exam
The specified room can be changed and the final location will be ready no later than 3 days before the exam. You can find your room location on Studentweb.