The course covers data structures and techniques for constructing efficient algorithms, including their analysis with respect to efficiency. It stresses the importance of adapting standard algorithms and data structures to the peculiarities of both the given problem and the underlying hardware, because efficiency does not only depend on the intrinsic asymptotic efficiency of an algorithm, but also on the context in which it is applied.
Typical algorithmic techniques are divide-and-conquer, greedy methods, and dynamic programming. As efficient data structures form the basis for many of these techniques, important data structures, their analysis and advantages and disadvantages depending on circumstances are covered as well. Examples of data structures to be covered are heaps, disjoint sets, and tree data structures.
The information below is only for exchange students
Starts
2 September 2024
Ends
31 October 2024
Study location
Umeå
Language
English
Type of studies
Daytime,
50%
Required Knowledge
At least 90 ECTS, including 60 ECTS Computing Science, or at least 120 ECTS within a study programme. At least 7.5 ECTS programming; 7.5 ECTS data structures and algorithms; 7.5 ECTS discrete mathematics; and 7.5 ECTS formal languages. Proficiency in English equivalent to the level required for basic eligibility for higher studies.
Selection
Students applying for courses within a double degree exchange agreement, within the departments own agreements will be given first priority. Then will - in turn - candidates within the departments own agreements, faculty agreements, central exchange agreements and other departmental agreements be selected.
Application code
UMU-A5701
Application
This application round is only intended for nominated exchange students. Information about deadlines can be found in the e-mail instruction that nominated students receive.
The application period is closed.
