The course includes advanced methods for design and analysis of discrete algorithms. We also study graf and geometrical algorithms, online and dynamic algorithms, randomisation and approximation in handling NP-hard problems.
Learning Outcomes
At the completion of INF334 the student should:
master advanced methods within algorithm design and analysis.
be able to use these methods to design practical algorithms for large or difficult problems.
be able to apply various methods that are developed for problems that cannot be solved efficiently within the classical P vs NP dichotomy.
Required Previous Knowledge
At least 120 ECTS in computer science, preferably including some mathematics
Recommended Previous Knowledge
INF 235
Forms of Assessment
Written exam. If less than 20 students are taking the course, it can be oral exam.
No aids allowed.
Grading Scale
The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.