Algorithms and Data Structures II
Course, Bachelor's level, 1DL231
Autumn 2023 Autumn 2023, Uppsala, 33%, On-campus, English
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 31 October 2023–14 January 2024
- Language of instruction
- English
- Entry requirements
-
60 credits of which 15 credits in mathematics and 25 credits in computer science. Alternatively 45 credits in the Master's Programme in Language Technology. Participation in Program Design and Data Structures of which 9 credits shall be completed, alternatively participation in Algorithms and Data Structures I. 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.
- Application fee: SEK 900
- First tuition fee instalment: SEK 10,833
- Total tuition fee: SEK 10,833
- Application deadline
- 17 April 2023
- Application code
- UU-11016
Admitted or on the waiting list?
- Registration period
- 17 October 2023–7 November 2023
- Information on registration.
Autumn 2023 Autumn 2023, Uppsala, 33%, On-campus, English For exchange students
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 31 October 2023–14 January 2024
- Language of instruction
- English
- Entry requirements
-
60 credits of which 15 credits in mathematics and 25 credits in computer science. Alternatively 45 credits in the Master's Programme in Language Technology. Participation in Program Design and Data Structures of which 9 credits shall be completed, alternatively participation in Algorithms and Data Structures I. Proficiency in English equivalent to the Swedish upper secondary course English 6.
Admitted or on the waiting list?
- Registration period
- 17 October 2023–7 November 2023
- Information on registration.
Autumn 2024 Autumn 2024, Uppsala, 33%, On-campus, English
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 4 November 2024–19 January 2025
- Language of instruction
- English
- Entry requirements
-
60 credits of which 15 credits in mathematics and 25 credits in computer science. Alternatively 45 credits in the Master's Programme in Language Technology. Participation in Program Design and Data Structures of which 9 credits shall be completed, alternatively participation in Algorithms and Data Structures I. 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.
- Application fee: SEK 900
- First tuition fee instalment: SEK 10,833
- Total tuition fee: SEK 10,833
- Application deadline
- 15 April 2024
- Application code
- UU-11016
Admitted or on the waiting list?
- Registration period
- 21 October 2024–11 November 2024
- Information on registration.
Autumn 2024 Autumn 2024, Uppsala, 33%, On-campus, English For exchange students
- Location
- Uppsala
- Pace of study
- 33%
- Teaching form
- On-campus
- Instructional time
- Daytime
- Study period
- 4 November 2024–19 January 2025
- Language of instruction
- English
- Entry requirements
-
60 credits of which 15 credits in mathematics and 25 credits in computer science. Alternatively 45 credits in the Master's Programme in Language Technology. Participation in Program Design and Data Structures of which 9 credits shall be completed, alternatively participation in Algorithms and Data Structures I. Proficiency in English equivalent to the Swedish upper secondary course English 6.
Admitted or on the waiting list?
- Registration period
- 21 October 2024–11 November 2024
- Information on registration.
About the course
The course extends and deepens your knowledge about algorithms and their analysis. After the course, you can design algorithms based on techniques such as dynamic programming and greedy algorithms, as well as derive their complexity from recursive equations. List of topics:
- solving recursive equations that describe the algorithm's complexity
- dynamic programming
- greedy algorithms
- graph algorithms: minimum spanning trees, shortest paths
- string matching.
Reading list
- Reading list valid from Autumn 2022, version 2
- Reading list valid from Autumn 2022, version 1
- Reading list valid from Autumn 2019
- Reading list valid from Autumn 2017
- Reading list valid from Spring 2013
- Reading list valid from Autumn 2012, version 3
- Reading list valid from Autumn 2012, version 2
- Reading list valid from Autumn 2012, version 1