Students learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials.
Objective
The objective of this course is to learn how to solve algorithmic problems given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them (using C/C++, STL, CGAL, and BGL).
Literature
T. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990. J. Hromkovic, Teubner: Theoretische Informatik, Springer, 2004 (English: Theoretical Computer Science, Springer 2003). J. Kleinberg, É. Tardos: Algorithm Design, Addison Wesley, 2006. H. R. Lewis, C. H. Papadimitriou: Elements of the Theory of Computation, Prentice Hall, 1998. T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum, 2012. R. Sedgewick: Algorithms in C++: Graph Algorithms, Addison-Wesley, 2001.
Performance assessment
Performance assessment information (valid until the course unit is held again)
The performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examination
written 360 minutes and 360 minutes
Additional information on mode of examination
Every student who completes all three assessments (read: shows up at the specified time and completes the process by giving feedback to the assistant in the electronic system) receives a bonus in form of a quarter-grade (+0.25) on their grade from the final exam.
Written aids
No documentation is allowed during the exam except what is provided by the system itself.
Online examination
The examination may take place on the computer.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.
Learning materials
No public learning materials available.
Only public learning materials are listed.
Groups
No information on groups available.
Restrictions
There are no additional restrictions for the registration.