TDDD20 · 6 credits · Advanced level (A1N) · Informationsteknologi, Datateknik, Datavetenskap
Design and Analysis of Algorithms
Active · next start VT 2027
73%
passed the latest ordinary exam
TEN1 · 26 Mar 2026 · 22 students
64%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 95 students
75%
Harder than 75% of courses at advanced level
Compared with 285 courses at the same level, ordinary exams over the last three academic years. 35 students.
Part of 8 programmes
- Master of Science in Engineering Mathematics
- Master of Science in Computer Science and Engineering
- Master of Science in Information Technology
- Master of Science in Computer Science and Software Engineering
- Master of Science in Applied Physics and Electrical Engineering - International
- Master of Science in Applied Physics and Electrical Engineering
- Master's Programme in Computer Science
- Master's Programme in Mathematics
Exam
TEN1 Written examination
- 5
- 4
- 3
- U
Ordinary exams
64% passed · 95 students
- 73%22
- 85%13
- 70%20
- 81%16
- 29%24
Re-exams
69% passed · 16 students
- 100%6
- 50%10
- Pass the re-exam: 69% (16 students), compared with 64% (95 students) on the ordinary exam
- Get 4 or 5: 32% (111 students)
Show small sittings (7)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 50%2
- 67%3
- 100%1
- 100%1
- 100%3
- 100%1
- 67%3
About the course
Aim
The primary aim of this course is to increase the student's skills in constructing and analysing algorithms. After the course, the students should be able to
- construct algorithms for computational problems,
- prove the correctness of algorithms, and
- analyze and evaluate algorithms for computational problems
Content
The course contains three main parts:
- Part 1: Basic techniques. Greedy algorithms, decomposition, and dynamic programming.
- Part 2: NP-completeness. The theory of NP-completeness and its consequences.
- Part 3: Inexact methods. Construction and analysis of approximation algorithms and randomized algorithms.
- Examiner
- Peter Jonsson
- Scheduled hours
- 30 h
- Main field of study
- Informationsteknologi, Datateknik, Datavetenskap