University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Design and Analysis of Algorithms (WS 2013/2014)


No lecture on
Nov 01 (holiday)

First tutorial on
Oct 28, 13:30

Design and analysis of efficient algorithms are omnipresent and thus their study is an important topic in computer science and beyond. This course provides a comprehensive overview of algorithmic questions and design techniques. We strive to convey an approach to algorithmics that begins with the systematic analysis of the problem, builds on an understanding of the common techniques to design algorithms, and results in an efficient solution to the problem.

This course is the basis for further studies in the field of algorithmics including graph algorithms. It provides advice on how to identify algorithmic problems in complex issues and how to design efficient and sophisticated algorithms for the resulting problems.

General Information

Lecture (S. Cornelsen) Fri 11:45 - 13:15 (L 601)
Fri 13:25 - 14:10 (P 603)
Tutorial (A. Nocaj) Mon 13:30 - 15:00 (M 701)

Oral Exam 1st date: Wed, 19th February (E 216)
extended 1st date: Wed, 19th March (PZ 1005?)
2nd date: Fri, 11th April

Please register for this course in the StudIS and LSF.

Homework Assignments

The assignments are made available on this webpage as a PDF-file (in English) every Friday after the lecture.

The editing time for each homework is almost one week. It is due on the next Friday at 08:00 (AM). The assignments have to be delivered in written form either in English or German. You can choose to either deposit them in the box for handout marked "Design and Analysis of Algorithms" in front of E 202 or to submit them electronically to (one PDF only!!). In the latter case, please follow the naming schema uXX_name1_name2.pdf, where XX indicates the number of the assignment. We will return the corrected and scored assignments in the tutorial. Whatever is not picked up will be placed back into the handout box.

The requirements for the admittance to the final exam are 50 percent of the total score of the assignments and regular attendance at the tutorials. In writing up your assignments, be as clear, precise, and concise as possible. Understandability will be an important factor in the scoring of the assignments. There will be approximately thirteen written assignments. Regular attendance is considered especially for borderline cases.

You are permitted and encouraged to work in groups of two.

No. Post Date Due Date Tutorial Download Material (local access only)
01 25.10.2013 01.11.2013 04.11.2013 Assignment1.pdf
02 01.11.2013 08.11.2013 10.11.2013 Assignment2.pdf
03 08.11.2013 15.11.2013 18.11.2013 Assignment3.pdf
04 15.11.2013 22.11.2013 25.11.2013 Assignment4.pdf
05 22.11.2013 29.11.2013 02.12.2013 Assignment5.pdf
06 29.11.2013 06.12.2013 09.12.2013 Assignment6.pdf
07 06.12.2013 13.12.2013 16.12.2013 Assignment7.pdf
08 13.12.2013 20.12.2013 13.01.2014 Assignment8.pdf
09 10.01.2013 17.01.2013 20.01.2013 Assignment9.pdf
10 17.01.2013 24.01.2013 27.01.2013 Assignment10.pdf
11 24.01.2014 31.01.2014 03.02.2014 Assignment11.pdf
12 31.01.2014 07.02.2014 10.02.2014 Assignment12.pdf

Note that some links are only locally accessible.

Some Lecture Notes and Supplemental Course Materials (locally accessible)


Further Information