Department of Computer Science | Institute of Theoretical Computer Science

CADMO - Center for Algorithms, Discrete Mathematics and Optimization

Algorithms Lab HS2018

Contact

For questions on exercises use the forums on moodle. For administrative questions or for reporting technical problems (with moodle or the judge), use algolab@lists.inf.ethz.ch.

Lecturers

Prof. Angelika Steger (contact),
Prof. Emo Welzl,
Prof. Peter Widmayer

Assistants

Dr. Luis F. Barba Flores,
Daniel Wolleb-Graf,
Dr. Michael Hoffmann (contact),
Hlynur Jonsson,
Johannes Kapfhammer,
Dr. Stefano Leucci,
Dr. Chih-Hung Liu,
Asier Mujika,
Nicolas Truessel,
Miloš Trujić,
Manuel Wettstein,
Xun Zou

Time & Place

Tutorials: Wednesday, 17-19, CAB G 61 (first tutorial: Sep 19, 2018)

Problem of the week: Monday, 17-19, CAB H 56, CAB H 57, HG E 26.1, or anywhere else (first PotW: Sep 24, 2018)

Consulting hours (until Oct. 12): Friday, 15-17, CAB G 15.2.

Assessment hours (starting Oct. 16): Tuesday 15-17, CAB G 15.2 and ML H34.3, Thursday 15-17, CAB G 15.2 and LFW B2, Friday 15-17, CAB G 15.2.

see also: vvz.ethz.ch

Objective

The objective of this course is to learn how to solve a problem given by a textual description. This includes appropriate problem modeling, choice of suitable algorithms, and a working implementation in C++.

Prerequisites

Content

In this course students learn how to solve algorithmic problems given by a textual, story-like description. We assume knowledge of elementary algorithms and data structures as they are typically taught on the Bachelor level. In tutorials we introduce more advanced algorithms and the usage of some standard libraries for combinatorial algorithms. Students practice their skills by solving weekly exercises. For that they have to understand the problem setting, find an appropriate modeling, choose suitable algorithms, and implement them using C/C++, STL, BGL, and CGAL. The evaluation of the correctness and efficiency of their solutions will be performed by an online-judge which compiles the submitted source-code and runs it on a set of test instances.

Organization

This course is a lab: Most of the time is spent working individually on the given problems.

In addition there is a weekly tutorial. These tutorials are not lectures in the classical sense. In particular we will not present theory and proofs there. Instead we rely on the corresponding knowledge gained during your Bachelor studies. The tutorials serve

Occasionally we will work with algorithms and data structures that the students may not have encountered during their Bachelor studies. Such algorithms and data structures will be properly introduced in the tutorials, with a focus on applications rather than on the underlying theory.

Every Wednesday after the tutorial we will hand out problem sets. The students hand in their solutions, using the online-judge, within one week.

Every Monday at 17:00 we post one problem as a "Problem of the Week". In order to score points for this problem, only solutions that are submitted within the following two hours are counted. The goal of this setup is to make students accustomed to exam conditions and provide an early feedback of where they stand.

NEW! Three times over the course of the semester every student is invited to an individual performance assessment. The assessment is performed as a one-on-one discussion with an assistant of at most 15min. that centers around a specific problem from the week(s) before. As part of the discussion, the students receive feedback on where they stand, summarized in a grade on an integer scale from 0 (work in progress) to 2 (well done). In turn, the students give feedback on the same scale as to whether or not they found the assessment and the feedback they received helpful. The time slots for the individual performance assessments come in three windows of three weeks each, starting in Mid October. The administration and time management is handled by an electronic system.

Exam/Grades

The grade of the course is solely based on the final exam. The exam takes place in a computer room, on two different days, 6 hours each, during the examination session. On both days you have to solve problems similar to those given during the semester.

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.

Synopsis

1. Fundamentals (Week 1-4) 2. Advanced Algorithms (Week 4-9) 3. Exam preparation (Week 10-14)

Technical Instructions

Please consult our technical FAQ to learn more about

Literature

Links