VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

263-0006-00L 8 Credits MSC D-ITET , D-MATH , D-INFK
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Algorithms Lab

Lecturers & Examiners: Prof. em. Dr. Emo Welzl, Prof. Dr. Angelika Steger
Only for master students!
VVZ CR 3.73

Last Updated: 2026-02-05 16:02:00

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
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.
Every student who completes all three assessments (read: shows up at the specified time and completes the process in the electronic system by giving feedback to the assistant in response to the feedback they received) receives a bonus in form of a quarter-grade (+0.25) on their grade from the final exam.

Registration & Places

Max Places
300
Priority: Registration for the course unit is until 29.09.2022 only possible for the primary target group

Course Components

Type Title Time & Place Hours
practical/laboratory course Algorithms Lab
  • Mon 14:15-16:00 (CAB H 57)
  • Mon 14:15-16:00 (HG E 26.1)
  • Mon 14:15-16:00 (HG E 26.3)
  • Tue 16:15-18:00 (ML H 34.3)
  • Wed 16:15-18:00 (CAB G 11)
  • Thu 16:15-18:00 (ML H 34.3)
4 h weekly
independent project Algorithms Lab
Project Work, no fixed presence required.
No time listed 3 h weekly

Offered In