This course provides an introduction to theoretical computer science, which is a strong research area at KTH. You will meet some of our research results in the course.
You will learn more about algorithm design and see some pretty complicated, but very useful, algorithms. The complexity part of the course is about how to investigate which problems can be solved (in reasonable time) with the help of computers, which problems take an unreasonably long time and which cannot be solved with a computer at all.
Problems that are too difficult to solve accurately can sometimes be solved approximately. You will see examples of some approximation algorithms and some problems that are so difficult that they cannot even be approximated in a reasonable time.
Choose semester and 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.
Content and learning outcomes
Design principles of algorithms: Decomposition, greedy algorithms, dynamic programming, local and exhaustive search. Algorithm analysis. Approximation algorithms and heuristics. Applications with algorithms for problems on sets, graphs, arithmetic and geometry. Implementation of algorithms.
Data structures: Review of hash tables and heaps; balanced trees, Bloom filters, persistent data structures Use and implementation of data structures. Computability and complexity: The concept of reduction, the complexity classes P (polynomial time) and NP (non-deterministic polynomial time). NP-complete problems, undecidable problems. Coping with computationally intractable problems.
Terminology in Swedish and English.
Intended learning outcomes
After passing the course, the student should be able to
- develop and implement algorithms with data structures and analyse them with respect to correctness and efficiency
- compare alternative algorithms and data structures regarding efficiency and reliability
- define and translate central concepts such as P, NP, NP-completeness and undecidability
- compare problems with respect to complexity by means of reductions
- handle problems with high complexity
in order to
- independently be able to design computer programs that use time and memory efficiently and thereby can contribute to economically and environmentally sustainable development
- in professional life identify and attack problems that are unrealistically resource demanding or not possible to solve on a computer.
Literature and preparations
Knowledge and skills in programming, 6 credits, equivalent to completed course DD1337/DD1310-DD1318/DD1321/DD1331/DD100N/ID1018.
Knowledge in foundations of computer science, 6 credits, equivalent to completed course DD1338/DD1320-DD1327/DD2325/ID1020/ID1021.
Knowledge in discrete mathematics, 3 higher education credits, equivalent to completed course SF1671/SF1610/SF1630/SF1662/SF1679.
Knowledge in algebra and geometry, 7.5 higher education credits, equivalent to completed course SF1624.
Knowledge in calculus in one variable, 7.5 higher education credits, equivalent to completed course SF1625.
Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course.
Being registered for a course counts as active participation.
The term 'final examination' encompasses both the regular examination and the first re-examination.
In lab 2, some knowledge of Java programming is needed. In some of the labs in the course, a more efficient programming language than Python has to be used, e.g. Java or C/C++.
Probability theory and statistics corresponding to SF1901 is recommended. Logic corresponding to DD1350/DD1351 is recommended but not necessary.
Knowledge of direcrete mathematics is necessary. A student who, at the beginning of the course, has not completed 7.5 higher education credits of discrete mathematics, equivalent to SF1610/SF1630/SF1662/SF1679, must take SF1688 in parallel with DD2350, see Additional Regulations in the course syllabus.
Algorithm Design by Kleinberg-Tardos, Pearson, 2014, ISBN 978-1292023946.
- Algorithms and Complexity, a supplement to Algorithm Design, Pearson Custom Publishing, ISBN 978-1847764126.
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
- LAB1 - Laboratory assignments, 4.0 credits, grading scale: A, B, C, D, E, FX, F
- MAS1 - Individual master´s test, 1.5 credits, grading scale: A, B, C, D, E, FX, F
- MAS2 - Individual master´s test, 1.5 credits, grading scale: A, B, C, D, E, FX, F
- TEN1 - Theory examination, 2.5 credits, grading scale: P, 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.
The master's tests are constituted by individual assignments that are reported both in writing and orally
Optional theoretical assignments with peer assessment that will give bonus points to the theory examination.
Opportunity to complete the requirements via supplementary examination
The requirements for E/pass for the components MAS1, MAS2 and TEN1 can be completed via supplementary examination for students receiving grade Fx. A passed individual lab assignment can be credited in later course offerings if the assignment is unchanged.
Opportunity to raise an approved grade via renewed examination
An approved grade can be raised for MAS1 and MAS2 in a later course offering. For LAB1, only grades B and C can be raised, with the grade rising lab in a later course offering. It is not possible to receive new lab delivery points in a later course offering.
- 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 about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.Course web DD2350
Main field of study
DD2440 Advanced Algorithms, DD2542 Seminars in Theoretical Computer Science, Algorithms and Complexity, DD2445 Complexity Theory, DD2448 Foundations of Cryptography, and DD2458 Problem Solving and Programming under Pressure.
Grading critera will be published at the start of the course.
The course has replaced DD1352. DD2350 cannot be combined with DD1352, DD2352, or DD2354.
In this course, the EECS code of honor applies, see:
A student who, at the beginning of the course, has not completed 7.5 higher education credits of discrete mathematics, equivalent to SF1610/SF1630/SF1662/SF1679, must take SF1688 in parallel with DD2350.