TDDI16 · 6 credits · Basic level (G1F) · Datateknik, Programmering
Data Structures and Algorithms
Active · next start HT 2026
45%
passed the latest regular sitting
DAT1 · 30 Oct 2025 · 112 students
61%
passed the regular sittings, all sittings over the last 5 years
DAT1 · 412 students
Unusually hard in 2025/26
45% passed the ordinary exam in 2025/26 (112 students), against 69% on average in earlier years (300 students).
Part of 3 programmes
Other module
DAT1 Computer examination
- 5
- 4
- 3
- U
Main rounds
61% passed · 412 students
- 45%112
- 45%88
- 69%78
- 79%63
- 80%71
Later rounds
63% passed · 126 students
- 40%10
- 46%37
- 73%33
- 83%6
- 71%21
- 63%8
- 82%11
- Pass a later round: 63% (126 students), compared with 61% (412 students) on the ordinary exam
- Get 4 or 5: 31% (538 students)
Show small sittings (3)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 0%2
- 50%2
- 50%2
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 hand-in assignment
- G
Main rounds
100% passed · 407 students
- 100%106
- 100%91
- 100%73
- 100%69
- 100%68
Later rounds
No sittings with at least 5 students.
Show small sittings (12)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
- 100%1
- 100%2
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
Hand-in or lab
LAB1 Programming assignments
- G
Main rounds
100% passed · 402 students
- 100%99
- 100%96
- 100%75
- 100%61
- 100%71
Later rounds
No sittings with at least 5 students.
Show small sittings (8)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%2
- 100%2
- 100%1
- 100%2
- 100%2
- 100%1
- 100%2
- 100%1
About the course
Aim
After a completed course, the student should be able to:
- analyze time- and memory complexity for iterative and recursive algorithms
- explain and use abstract datatypes and sorting algorithms
- implement abstract datatypes and discuss implementation options for choice of data structure and algorithm
Content
The lectures covers data structures and algorithms from a principal point of view, but based on concrete examples. Data structures covered are lists, stacks, queues, graphs, special trees, and hash tables, which also include algorithms for operating on these data structures. The general algorithms covered are algorithms for searching and sorting. Basic analysis of requirements regarding time and space for the data structures and algorithms is included. The lessons are dedicated to some preparation of the programming exercises but mainly for solving problems concerning data structures and algorithms, and are in that respect preparing for the written exam. The programming exercises is a series of smaller programming exercises.
- Examiner
- Filip Strömbäck
- Scheduled hours
- 42 h
- Main field of study
- Datateknik, Programmering