Fundamental data structures: Lists, stacks, queues, priority queues, sets, hash tables, trees and graphs. Fundamental algorithms: Search, sorting, tree algorithms and some other types of algorithms. Introduction to algorithm analysis. The programming language Java is used.
DD1338 Algorithms and Data Structures 6.0 credits
Information per course offering
Choose semester and course offering to see current information and more about the course, such as course syllabus, study period, and application information.
Information for Autumn 2025 alginda25 programme students
- Course location
KTH Campus
- Duration
- 17 Nov 2025 - 13 Mar 2026
- Periods
Autumn 2025: P2 (2.0 hp)
Spring 2026: P3 (4.0 hp)
- Pace of study
25%
- Application code
50297
- Form of study
Normal Daytime
- Language of instruction
Swedish
- Course memo
- Course memo is not published
- Number of places
Places are not limited
- Target group
Only CDATE.
- Planned modular schedule
- [object Object]
- Schedule
- Schedule is not published
- Part of programme
Contact
Richard James Glassey (glassey@kth.se)
Course syllabus as PDF
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus DD1338 (Autumn 2021–)Headings with content from the Course syllabus DD1338 (Autumn 2021–) are denoted with an asterisk ( )
Content and learning outcomes
Course contents
Intended learning outcomes
On completion of the course, course participant should be able to
- solve computational problems by means of programming,
- analyse, choose, use and implement basic algorithms and data structures
- participate in professional programming activities
in order to
- find and use correct algorithms and data structures for a given problem,
- take advanced courses within computer science and numerical analysis.
Literature and preparations
Specific prerequisites
Knowledge and skills in object-oriented programming, 7 credits, corresponding to completed course DD1337 alternatively both courses DD1310 and DD1380.
Active participation in a course offering where the final examination is not yet reported in Ladok is considered equivalent to completion of the course.
Registering for a course is counted as active participation.
The term 'final examination' encompasses both the regular examination and the first re-examination.
Recommended prerequisites
DD1337 Programming.
Equipment
No information inserted
Literature
No information inserted
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
A, B, C, D, E, FX, F
Examination
- HEM1 - Assignment, 6.0 credits, grading scale: A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
Opportunity to complete the requirements via supplementary examination
No information inserted
Opportunity to raise an approved grade via renewed examination
No information inserted
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.
Further information
Course room in Canvas
Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.
Offered by
Main field of study
Technology
Education cycle
First cycle
Add-on studies
Parallel programming DD1396, DD1349 Project.
Contact
Richard James Glassey (glassey@kth.se)
Supplementary information
Only one of the following courses can be counted in your degree: DD1320, DD1321, DD1325, DD1327, DD1338, DD1339, DD1340, DD1341, DD1343, DD1344, DD1345, DD2325, EL2310, HI1201, ID1020.
In this course, the EECS code of honor applies, see:
http://www.kth.se/en/eecs/utbildning/hederskodex