Fundamental Algorithms WS 2008/09

News | Basic information | Contents | Slides | Tutorial

We offer an optional tutorial course on every

Monday, 11:00–12:30 in MI 03.09.014,

starting November 3.

Exercise sheets

Exercise sheets will be available on Friday before the tutorials.

• Tutorial 03.11.2008: Exercise sheet 1 – Solution keys
• Tutorial 10.11.2008: Exercise sheet 2 – Solution keys
• Tutorial 24.11.2008: Exercise sheet 3 – Solution keys
• Tutorial 01.12.2008: Exercise sheet 4 – Solution keys
• Tutorial 08.12.2008: Exercise sheet 5 – Solution keys
• Tutorial 15.12.2008: Exercise sheet 6 – Solution keys
• Tutorial 12.01.2009: Exercise sheet 7 – Solution keys
• Tutorial 19.01.2009: Exercise sheet 8 – Solution keys
• Tutorial 26.01.2009: Exercise sheet 9 – Solution keys

Note that the provided solution keys do not cover everything discussed in the course and can be incomplete.

Literature

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein: Introduction to Algorithms, 2nd Print, MIT Press, 2001
• Gilles Brassard and Paul Bratley: Fundamentals of Algorithmics, Prentice-Hall, 1996
• Mark A. Weiss: Data Structures & Algorithm Analysis in Java, Addison-Wesley, 1999
• Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman: Data Structures and Algorithms, Addison-Wesley, 1983
• Introduction to Asymptotic Notations

Tutor

Dejvuth Suwimonteerabuth