TDDE22 · 6 credits · Basic level (G2F) · Informationsteknologi, Datateknik
Data Structures and Algorithms
Active · next start HT 2026
75%
passed the latest regular sitting
DAT1 · 31 Oct 2025 · 72 students
82%
passed the regular sittings, all sittings over the last 5 years
DAT1 · 319 students
63%
Harder than 63% of courses at basic level
Compared with 874 courses at the same level, ordinary exams over the last three academic years. 134 students.
Part of 4 programmes
Other module
DAT1 Computer examination
- 5
- 4
- 3
- U
Main rounds
82% passed · 319 students
- 75%72
- 68%62
- 81%57
- 88%52
- 96%76
Later rounds
62% passed · 69 students
- 56%9
- 63%16
- 44%9
- 65%20
- 70%10
- 80%5
- Pass a later round: 62% (69 students), compared with 82% (319 students) on the ordinary exam
- Get 4 or 5: 55% (388 students)
Show small sittings (5)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%3
- 100%1
- 0%1
- 100%4
- 100%2
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
LAB2 Laboratory Work
- G
Main rounds
100% passed · 196 students
- 100%70
- 100%65
- 100%61
Later rounds
No sittings with at least 5 students.
Hand-in or lab
UPG3 Computer-based hand-in assignments
- G
Main rounds
100% passed · 190 students
- 100%71
- 100%62
- 100%57
Later rounds
No sittings with at least 5 students.
Show small sittings (9)
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%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
Hand-in or lab
LAB1 Laboratory Work
- G
Main rounds
100% passed · 134 students
- 100%56
- 100%78
Later rounds
No sittings with at least 5 students.
Show small sittings (2)
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
Hand-in or lab
UPG2 Computer-based hand-in assignments
- G
Main rounds
100% passed · 128 students
- 100%54
- 100%74
Later rounds
No sittings with at least 5 students.
Show small sittings (5)
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%1
- 100%1
- 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 course aims to offer students tools to gain ability to construct computer programs efficiently using time and memory.
- Concepts
- Algorithm complecity analysis
- Abstract data types and data structures: lists, stacks, queues, search trees, hash tables and graphs
- Algorithm resource analysis
- Sorting and selection
- Paradigms for design of algorithms
- Examiner
- Filip Strömbäck
- Scheduled hours
- 52 h
- Main field of study
- Informationsteknologi, Datateknik