Enrolment ONLY for MSc students with a decree declaring this course unit as an additional admission requirement.
Any other students (e.g. incoming exchange students, doctoral students) CANNOT enrol for this course unit.
This course is about fundamental algorithm design paradigms (such as induction, divide-and-conquer, backtracking, dynamic programming), classic algorithmic problems (such as sorting and searching), and data structures (such as lists, hashing, search trees). The connection between algorithms and data structures is explained for geometric and graph problems.
An understanding of the design and analysis of fundamental algorithms and data structures.