University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Design and Analysis of Algorithms (WS 2012/2013)

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

Lecture (U. Brandes, S. Kosub) Tue 18:45 - 20:15 (F 420)
Wed 18:45 - 20:15 (F 420)
Tutorial (S. Cornelsen, N. Indlekofer) Fri 13:30 - 15:00 (P 603)

Oral Exam 1st date: 20 February 2013
2nd date: 10 April 2013

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 "Design and Analysis of Algorithms" in front of E 202 or to submit them electronically to the teaching assistant (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.

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 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 Tutor Material (local access only)
01 24.10.2012 31.10.2012 02.11.2012 Assignment1.pdf Natalie
02 31.10.2012 07.11.2012 09.11.2012 Assignment2.pdf Natalie
03 07.11.2012 14.11.2012 16.11.2012 Assignment3.pdf Natalie
04 14.11.2012 21.11.2012 23.11.2012 Assignment4.pdf Natalie
05 21.11.2012 28.11.2012 30.11.2012 Assignment5.pdf Natalie
06 28.11.2012 05.12.2012 07.12.2012 Assignment6.pdf Natalie
07 05.12.2012 12.12.2012 14.12.2012 Assignment7.pdf Sabine
08 12.12.2012 19.12.2012 21.12.2012 Assignment8.pdf Sabine
09 19.12.2012 09.01.2013 11.01.2013 Assignment9.pdf Sabine
10 09.01.2013 16.01.2013 18.01.2013 Assignment10.pdf Sabine
11 16.01.2013 23.01.2013 25.01.2013 Assignment11.pdf Sabine
12 23.01.2013 30.01.2013 01.02.2013 Assignment12.pdf Sabine
13 30.01.2013 06.02.2013 08.02.2013 Assignment13.pdf Sabine

Note that some links are only locally accessible.

Lecture Notes and Supplemental Course Materials in German

Some Lecture Notes from a Previous Course and Supplemental Course Materials in English

Textbooks

Further Information (in German)