University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Design and Analysis of Algorithms (WS 2010/2011)

Announcements

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

From 19 October till 3 December:
Lecture (U. Brandes, S. Cornelsen) Tue 10:15 - 11:45 (C 424)
Wed 14:30 - 16:00 (G 421)
Tutorial (M. Badent, N. Indlekofer) Fri 8:30 - 10:00 (C 424)

From 7 December:
Lecture (U. Brandes, S. Cornelsen) Wed 14:30 - 16:00 (G 421)
Fri 8:30 - 10:00 (C 424)
Tutorial (M. Badent, N. Indlekofer) Tue 10:15 - 11:45 (C 424)
Oral Exam 1st date: 16 February 2011
2nd date: 30 March 2011

Please register for this course in the StudIS and LSF.

Homework Assignments

Normally, the assignments are made available on this webpage as a PDF-file (in English) every Wednesday at 16:00.

The editing time for each homework is almost one week. It is due on the next Wednesday at 14:30. 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 "Abgabe" in the staircase on E2, in front of the door to the rooms E 209-216, or to submit them electronically to the two teaching assistants (as 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 marked "Rückgabe".

The requirements for the admittance to the final exam are 50 percent of the total score of the assignments, regular attendance at the tutorials, and the presentation of at least two of your solutions of the assignments. 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 twelve 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 Tutor
01 20.10.2010 27.10.2010 29.10.2010 Assignment1.pdf Melanie
02 27.10.2010 03.11.2010 05.11.2010 Assignment2.pdf Melanie
03 03.11.2010 10.11.2010 12.11.2010 Assignment3.pdf Melanie
04 10.11.2010 17.11.2010 19.11.2010 Assignment4.pdf Natalie
05 17.11.2010 24.11.2010 26.11.2010 Assignment5.pdf Natalie
06 24.11.2010 01.12.2010 03.12.2010 Assignment6.pdf Natalie
07 01.12.2010 08.12.2010 07./14.12.2010 Assignment7.pdf Natalie
08 08.12.2010 15.12.2010 21.01.2010 Assignment8.pdf Natalie
09 15.12.2010 22.12.2010 11.01.2011 Assignment9.pdf Natalie
10 22.12.2010 12.01.2011 18.01.2011 Assignment10.pdf Melanie
11 12.01.2011 19.01.2011 25.01.2011 Assignment11.pdf Melanie
12 19.01.2011 26.01.2011 01.02.2011 Assignment12.pdf Melanie
13 26.01.2011 02.02.2011 08.02.2011 Assignment13.pdf Melanie

Note that some links are only locally accessible.

Lecture Notes (in German) and Supplemental Course Materials

Textbooks

Further Information (in German)