Course
Algorithm Theory (DAT600)
The course gives insight into theory of algorithms and their performance. It includes a mathematical foundation for analysing the correctness of algorithms and for assessing their running time. The course introduces common computational problems and various techniques for solving them. The course also introduces the problem P=NP
Dette er emnebeskrivelsen for studieåret 2025-2026
Fakta
Emnekode
DAT600
Vekting (stp)
10
Semester undervisningsstart
Autumn
Undervisningsspråk
English
Antall semestre
1
Vurderingssemester
Autumn
Content
Learning outcome
After completing this course the student should be able to:
- Be familiar with important principles for designing advanced algorithms and assessing their performance.
- Be familiar with important problems and algorithms that solve them.
- Can choose and apply different types of algorithms depending on what the information systems demand.
- Be familiar with the classes of problems P, NP, NP-Hard, NP-Complete.
- Can transform a problem to an optimisation problem and practically solve it using optimisation software packages.
Forkunnskapskrav
Anbefalte forkunnskaper
Exam
Form of assessment | Weight | Duration | Marks | Aid |
---|---|---|---|---|
Written exam | 1/1 | 4 Hours | Letter grades | No printed or written materials are allowed. Approved basic calculator allowed |
Digital exam.