Algorithms and Data Structures
WS 2013/2014

Topics

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. Examples of algorithmic problems to be covered are graph problems, such as minimum spanning trees, various shortest path problems, network flows, matchings, geometric constructs, such as convex hulls, Voronoi diagrams, and arrangments, and algebraic topics such as FFT.

Time & Date

This core course will be offered in an intensive block version between 24 Feb 2014 and 28 March 2014.

The format of the course will be as follows: A "unit" consists of a 60 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 first starting at 9am, the second at 2pm, Monday through Friday, except for Wednesday afternoon, which will be free. A more precise schedule that includes information on the location of the lectures can be found below.

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

Assistants

László Kozma
Email: kozma at cs.uni-saarland.de
Office hours: blank

Lavinia Dinu
Email: ldinu at cs.uni-saarland.de
Office hours: Tu, Th 12:00-13:00

Igor Stassiy
Email: istassiy at cs.uni-saarland.de
Office hours: blank

Fabian Wobito
Email: s9fawobi at stud.uni-saarland.de
Office hours: blank

---

Grading

Your final grade will be determined by your performance on a midterm exam (40%) and a final exam (60%). Alternatively, the grade can be determined by your performance on the repeat exam only. Admittance to the exams requires active participation in the course.

Exams

Midterm: March 14, 2014, 15-18
Endterm: March 31, 2014, 15-18 Günter Hotz HS
Reexam: April 25, 2014, 16-19 Günter Hotz HS

Script

• Union-Find-Slides

Others

• Schedule of Core Lecture

---

back