Algorithms and Data Structures III
Course, Master's level, 1DL481
Spring 2025 Spring 2025, Uppsala, 33%, On-campus, English
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 20 January 2025–23 March 2025
- Language of instruction
- English
- Entry requirements
-
120 credits including 30 credits in mathematics including an introduction to linear algebra (Linear Algebra and Geometry I or the equivalent) and basic logic (Algebra I, Basic Course in Mathematics, or the equivalent), and 45 credits in computer science. Participation in Algorithms and Data Structures II. Proficiency in English equivalent to the Swedish upper secondary course English 6.
- Selection
-
Higher education credits in science and engineering (maximum 240 credits)
- Fees
-
If you are not a citizen of a European Union (EU) or European Economic Area (EEA) country, or Switzerland, you are required to pay application and tuition fees.
- First tuition fee instalment: SEK 12,083
- Total tuition fee: SEK 12,083
- Application deadline
- 15 October 2024
- Application code
- UU-61034
Admitted or on the waiting list?
- Registration period
- 20 December 2024–27 January 2025
- Information on registration from the department
Spring 2025 Spring 2025, Uppsala, 33%, On-campus, English For exchange students
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 20 January 2025–23 March 2025
- Language of instruction
- English
- Entry requirements
-
120 credits including 30 credits in mathematics including an introduction to linear algebra (Linear Algebra and Geometry I or the equivalent) and basic logic (Algebra I, Basic Course in Mathematics, or the equivalent), and 45 credits in computer science. Participation in Algorithms and Data Structures II. Proficiency in English equivalent to the Swedish upper secondary course English 6.
Admitted or on the waiting list?
- Registration period
- 20 December 2024–27 January 2025
- Information on registration from the department
About the course
The course covers advanced techniques in algorithm analysis and design. Central topics for the course are the analysis of algorithm complexity, including NP-completeness, and design methods such as randomised algorithms and approximation. In addition, the course presents connections to modern research in algorithmics.