TDDD86 · 11 credits · Basic level (G1F) · Datateknik, Datavetenskap

Data Structures, Algorithms and Programming Paradigms

Active · next start HT 2026

95%

passed the latest regular sitting

DAT1 · 12 Jan 2026 · 123 students

93%

passed the regular sittings, all sittings over the last 5 years

DAT1 · 641 students

18%

Harder than 18% of courses at basic level

Compared with 874 courses at the same level, ordinary exams over the last three academic years. 254 students.

Part of 2 programmes

Master of Science in Computer Science and Engineeringsemester 3 · period 1, 2 · compulsory
Master of Science in Computer Science and Software Engineeringsemester 3 · period 1, 2 · compulsory

Other module

DAT1 Computer examination

Main rounds

93% passed · 641 students

12 Jan 202695%123

19 Dec 202492%131
8 Jan 202494%144
15 Dec 202289%127
15 Dec 202191%116

Later rounds

83% passed · 65 students

17 Mar 202683%6
26 Aug 2025100%6
18 Mar 2025100%8
20 Sep 202457%7
13 Mar 202458%12
15 Mar 202394%18
16 Mar 202288%8

Pass a later round: 83% (65 students), compared with 93% (641 students) on the ordinary exam
Get 4 or 5: 32% (706 students)

Show small sittings (4)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

25 Aug 202675%4
1 Jan 202550%2
22 Aug 202350%2
23 Aug 2022100%1

Other modules

Partial exams, hand-ins and labs. They are not part of the figures at the top.

Hand-in or lab

UPG1 Computer based exercises

Main rounds

100% passed · 629 students

12 Jan 2026100%120
16 Jan 2025100%126
10 Jan 2024100%140
10 Jan 2023100%122
10 Jan 2022100%121

Later rounds

100% passed · 6 students

9 Feb 2026100%6

Pass a later round: 100% (6 students), compared with 100% (629 students) on the ordinary exam

Show small sittings (17)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

13 Aug 2026100%1
18 May 2026100%1
13 Apr 2026100%2
28 Feb 2026100%1
7 Nov 2025100%1
4 Sep 2025100%1
5 May 2025100%1
9 Sep 2024100%1
22 Feb 2024100%1
27 Nov 2023100%1
14 Nov 2023100%1
16 Oct 2023100%1
3 Oct 2023100%1
27 Sep 2023100%1
6 Apr 2023100%2
4 Apr 2022100%2
29 Oct 2021100%1

Hand-in or lab

LAB1 Programming assignments

Main rounds

100% passed · 507 students

16 Jan 2026100%93
27 Jan 2025100%111
10 Jan 2024100%109
10 Jan 2023100%108
10 Jan 2022100%86

Later rounds

100% passed · 102 students

2 Feb 2026100%26
6 Feb 2025100%5
31 Jan 2024100%5
24 Jan 2024100%14
3 May 2023100%5
20 Mar 2023100%9
6 Feb 2023100%11
4 Apr 2022100%16
30 Jan 2022100%11

Pass a later round: 100% (102 students), compared with 100% (507 students) on the ordinary exam
Get 4 or 5: 48% (609 students)

Show small sittings (29)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

9 Mar 2026100%2
4 Feb 2026100%2
25 Nov 2025100%1
21 Nov 2025100%2
20 Nov 2025100%4
3 Nov 2025100%1
31 Mar 2025100%1
13 Mar 2025100%3
24 Feb 2025100%2
19 Feb 2025100%4
15 Nov 2024100%1
14 Nov 2024100%1
23 Oct 2024100%2
22 Oct 2024100%2
11 Oct 2024100%1
19 Jun 2024100%4
28 May 2024100%2
29 Apr 2024100%2
23 Apr 2024100%1
19 Apr 2024100%4
23 Feb 2024100%1
17 Jan 2024100%2
13 Dec 2023100%1
15 Nov 2023100%2
14 Nov 2023100%4
3 Feb 2023100%2
17 Nov 2022100%1
4 Oct 2022100%1
29 Oct 2021100%1

Hand-in or lab

UPG2 Written assignment

Main rounds

100% passed · 262 students

12 Jan 2026100%85
8 Jan 2024100%90
20 Dec 2021100%87

Later rounds

100% passed · 332 students

22 Jan 2026100%30
5 Sep 2025100%7
1 Apr 2025100%5
29 Jan 2025100%38
27 Jan 2025100%70
2 Feb 2024100%39
10 Jan 2023100%25
11 Dec 2022100%93
12 Oct 2022100%6
31 Jan 2022100%19

Pass a later round: 100% (332 students), compared with 100% (262 students) on the ordinary exam

Show small sittings (25)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

11 Sep 2026100%1
2 Sep 2026100%4
12 May 2026100%1
28 Feb 2026100%1
2 Feb 2026100%1
16 Jan 2026100%1
24 Nov 2025100%2
9 Sep 2025100%1
15 Feb 2025100%4
31 Jan 2025100%1
24 Jan 2025100%1
1 Oct 2024100%2
20 Mar 2024100%1
16 Feb 2024100%2
16 Nov 2023100%1
11 Sep 2023100%2
22 May 2023100%1
10 Apr 2023100%1
4 Apr 2023100%1
3 Apr 2023100%1
13 Feb 2023100%3
2 Feb 2023100%2
17 Dec 2022100%1
28 Nov 2022100%1
30 Mar 2022100%1

About the course

Aim

The purpose of the course is to give the student tools to be able to independently construct computer programs that use time and memory efficiently. Furthermore, the course gives deeper knowledge about programming, specifically procedural and object-oriented programming in the programming language C++, as well as an introduction to programming paradigms as a broader perspective on programming. Upon completion of this course the student should be able to:

Demonstrate the ability to analyze time and space complexity of iterative and simple recursive algorithms.
Explain and use the most common abstract data types and sorting algorithms.
Implement the most common abstract data types and sorting algorithms with different data structures and algorithms.
Describe established methods for design (and analysis) of algorithms in general.
Implement procedural and object-oriented programs in the programming language C++.
Solve non-trivial computational tasks by using different components of the C++ standard library in combination.
Describe and compare the most common programming paradigms and their underlying principles.
Be able to apply effective algorithms to better understand social problems linked to sustainable development.

Content

Basic notions
Mathematical foundations for analysis of algorithms
Fundamental abstract data types and data structures, such as lists, stacks, queues, search trees, heaps, hash tables, and graphs
Efficiency analysis of algorithms
Sorting and searching
String algorithms
Graph algorithms
Algorithmic paradigms (dynamic programming, greedy algorithms, divide and conquer, brute force search)
Procedural programming in C++ (variables, constants, declarations, expressions, statements, functions, fundamental data types and fundamental data structures)
Pointers and dynamic memory management
Object-oriented programming and classes in C++ (class declaration, data members, member functions, access specification for class members, constructors, destructor, inheritance, polymorphism, friends)
Usage of the C++ standard library (input and output, character and string handling, containers, iterators, algorithms, user defined function objects and lambda expressions)
Type parameterized functions and classes (templates) in C++
Introduction to programming paradigms
Introduction to efficient algorithms importance for society's goals of sustainable development

Examiner: Ulf Kargén
Scheduled hours: 90 h
Main field of study: Datateknik, Datavetenskap

Syllabus on Studieinfo ↗