Advanced Algorithms and Data Structures (AADS)
Algorithms is about finding scalable solutions to computational problems, and the reliance is only increasing as we enter the world of Big Data. We want algorithms that solve problems efficiently relative to the input size. Exponential time is hopeless. We generally want polynomial time, and for large problems we need linear time. Sometimes we employ data structures that represent the input so that queries about it can be answered very efficiently. In this mandatory course, we will study the list of algorithmic topics below. Some of these topics are covered in more depth in more specialised elective courses.
MSc Programme in Computer Science
MSc Programme in Computer Science (part time)
MSc Programme in Computer Science with a minor subject
MSc Programme in Bioinformatics
- Graph algorithms such as max flow.
- Data structures such as van Emde Boas Trees.
- Exponential and parameterised algorithms for NP-hard problems.
- Approximation algorithms.
- Randomised algorithms.
- Computational geometry.
- Linear programming and optimisation.
- Analyse algorithms with respect to correctness and efficiency.
- Explain and use basic randomised algorithms.
- Recognise NP-hard problems and address them, e.g., using approximation algorithms.
- Explain and use algorithms for different abstract domains such as graphs and geometry.
- Formulate real-life problems as algorithmic problems and solve them.
- Analyse a computational problem in order to find an appropriate algorithmic approach to solve it.
A mix of lectures and exercises.
See Absalon when the course is set up.
It is assumed that the students are familiar with basic
algorithms (sorting, selection, minimum spanning trees, shortest
paths) and data structures (lists, stacks, binary trees, search
Academic qualifications equivalent to a BSc degree is recommended.
PhD’s can register for MSc-course by following the same procedure as credit-students, see link above.
- 7,5 ECTS
- Type of assessment
Oral examination, 30 minutes
- Type of assessment details
- Oral examination in course curriculum with 30 minutes preparation
- All aids allowed
- Marking scale
- 7-point grading scale
- Censorship form
- External censorship
Criteria for exam assessment
See learning outcome.
Single subject courses (day)
- Theory exercises
- Course number
- 7,5 ECTS
- Programme level
- Full Degree Master
- Block 2
- No limit
The number of seats may be reduced in the late registration period
- Study Board of Mathematics and Computer Science
- Department of Computer Science
- Faculty of Science
- Christian Wulff-Nilsen (7-6d71716e71717c42666b306d7730666d)
Mikkel Abrahamsen, Jacob Holm, Danupon Nanongkai, Pawel Winter, Christian Wulff-Nilsen
- 22E-B2-2;Hold 01;;Advanced algorithms and data structures
- 22E-B2-2;Hold 02;;Advanced algorithms and data structures
- 22E-B2-2;Hold 03;;Advanced algorithms and data structures
- 22E-B2-2;Hold 04;;Advanced algorithms and data structures
- 22E-B2-2;Hold 05;;Advanced algorithms and data structures
- 22E-B2-2;Hold 06;;Advanced algorithms and data structures
- 22E-B2-2;Hold 07;;Advanced algorithms and data structures
Are you BA- or KA-student?
Courseinformation of students