VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Algorithms Lab
Last Updated: 2026-06-03 00:07:36
Abstract
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).
Resources
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.
General Information
- Language
- English
- Levels
- MSC , NDS
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- written 300 minutes and 300 minutes
- Aids
- No documentation is allowed during the exam except what is provided by the system itself.
- Digital
- The exam takes place on devices provided by ETH Zurich.
Registration & Places
- Max Places
- 350
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| practical/laboratory course | Algorithms Lab | No time listed | 4 h weekly |
| independent project |
Algorithms Lab
Project Work, no fixed presence required.
|
No time listed | 3 h weekly |