DM803: Advanced Data Structures
Examination tests for DM803 are offered (as part of courses offered spring 2020): Ordinary examination June 2020 and re-examination in August 2020 and January 2021.
Students taking the course are expected to have knowledge of:
- the subject in DM553 and courses recommended for that, in particular
- data structures such as balanced search trees, priority queues via the heap implementation, disjoint sets
- time and space analysis, including asymptotic notation, recursion equations
The course build on competences obtained in DM553 Complexity and Computability in particular, and gives competences for master thesis work in the area.
With reference to the educations competence profile, the course has focus on
- comprehending a complex problem
- analyzing and working with complex assignments
- working towards solutions, both independently and as part of a team
Expected learning outcome
At the end of the course, the student should be able to:
- explain the functionality and correctness of the covered algorithms and data structures
- analyze the covered algorithms and data structures wrt. time and space complexity
- design efficient algorithms and data structures for variants of the covered problem scenarios
- explain the problems involved in implementing the covered algorithms and data structures in standard programming languages
Exam element a)
The exam consists of an oral examination and a project with an overall evaluation.
The examination form for re-examination may be different from the exam form at the regular exam.
Indicative number of lessons
The teaching method is based on three phase model.
- Intro phase: 28 hours
- Skills training phase: 28 hours, hereof 28 hours tutorials
Activities during the study phase:
- Solve assignments
- Read the assigned literature
- Practice to apply the acquired knowledge
|Kim Skak Larsenemail@example.com||Institut for Matematik og Datalogi, Datalogi|