Algorithms and Data Structures 18 (Block Course)
WS 2017/2018

Raimund Seidel
E 1 3, Room 409
+49 (681) 302-4513
rseidel at
Mo, Fr 11:00-12:00

Please register for the course.

The course will cover basic and advanced data structures and algorithms and their analysis. Examples of data structures are cuckoo hashing, splay trees, randomized search trees, pairing heaps, union-find structures. In terms of algorithms, we first focus on graph problems (testing connectivity, minimum spanning trees, shortest path problems, network flows, and matchings) and later on geometric problems and on approximation algorithms.
Time & Date
This core course will be offered in an intensive block version between February 26 and March 23.

The format of the course will be as follows: A "unit" consists of a 70 minute lecture, followed by 2 hours group work on an exercise sheet, followed by a short discussion section with a tutor. Typically we will have two units a day, the starting at 9am, the second at 2pm, Monday through Friday, except for Wednesday afternoon, which will be free.

In the week February 26th through March 2nd the lectures will be in HS1, building E2 5, and the tutorials will be in SR014, SR015, and SR016 in building E1 3. The tutorials will start at 11:45am and at 4:45pm, respectively.

This will be a very intensive course. Do not plan on doing anything else seriously beside it.

Raimund Seidel
Email: rseidel at
Office hours: Mo, Fr 11:00-12:00
Your final grade will be determined by your performance on a midterm exam (40%) and a final exam (60%). There will be a repeat exam for the final. Admittance to the exams requires active participation in the course.
Midterm: March 14, 2018, 9:30--11:30
Endterm: March 28, 2018, 15:00-18:00
Reexam: April 25, 2018, TBA