DM819: Computational Geometry
Knowledge of algorithms and data structures and their analysis is assumed, including algorithm design techniques such as divide-and-conquer, balanced binary search trees such as red-black tree, as well as correctness analysis and complexity analysis using recursion equations and asymptotic notation. Further prerequisites includes results on lower bounds for sorting and basic understanding of probability theory. The prerequisites can be obtained through the courses DM507 and DM549, together with parts of DM551 and DM553.
- comprehending a complex problem
- analyzing and working with complex assignments
- working towards solutions, both independently and as part of a team
Expected learning outcome
- 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 in detail the problems involved in implementing the covered algorithms and data structures in standard programming languages
Exam element a)
The examination form for re-examination may be different from the exam form at the regular exam.
Indicative number of lessons
|Kim Skak Larsenemail@example.com||Institut for Matematik og Datalogi, Datalogi|