Course
Algorithm Theory (DAT600)
Facts
Course code DAT600
Credits (ECTS) 10
Semester tution start Spring
Language of instruction English
Number of semesters 1
Exam semester Spring
Time table View course schedule
Literature Search for literature in Leganto
Introduction
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
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.
Required prerequisite knowledge
Recommended prerequisites
Exam
Written exam
Weight 1/1
Duration 4 Hours
Marks Letter grades
Aid No printed or written materials are allowed. Approved basic calculator allowed
Digital exam.