Lectures Fundamentals of Algorithms and Data Structures (GAD) Efficient Algorithms and
Data Structures II Network Algorithms Computational Biology I Proseminar Algorithms in Computer Graphics Seminar Computational Geometry Lab Course Discrete Optimization Courses for PhD Students Oberseminar

Fundamentals of Algorithms and Data Structures

• Lecturer:
  Prof. Dr. Christian Scheideler Please see the German website (click on the German flag) to access the slides and lecture notes.
• Module: IN0007
• Area:
  3+2 lectures per week in Bachelor of Science in Computer Science (compulsory course)
  3+2 lectures per week in Bachelor of Science in Bioinformatics (compulsory course)
  
• Time and Place:
  Tue, 12:00-13:30, PH HS 1
  Thu, 13:00-13:45, MI HS 1
• NEWS: Bitte beachten Sie, dass die Uebungsstunden erst am Freitag, 25. April beginnen!
  
• Exercises:
  2 hours per week exercises accompanying the lecture
  Teaching assistant: Stefan Schmid
• Audience:
  Students in Computer Science (Bachelor of Science)
  Students in Bioinformatics (Bachelor of Science)
  Students in Information Systems (Bachelor of Science)
  
• ECTS: 6 credits
• Prerequisits:
  Basic knowledge in computer science
• Recommended for:
  Fundamental knowledge in topic Algorithms, Bioinformatics
• Information:
  During the course
• Contents: The lectures are planned to deal in particular with the following topics:
  1. Foundations
  2. Basic data structures
  3. Advanced data structures
  4. Sorting and selecting
  5. Algorithms on graphs
  6. Algorithms on texts
  7. Data compression
• Related and advanced lectures:
  Efficient algorithms and data structures
• Lecture Notes:
  See the following related manuscript: K. Mehlhorn, P. Sanders: Algorithms and Data Structures - The Basic Toolbox
• References:
  Complementary and additional in-depth material can be taken from:
  1. Michael T. Goodrich, Roberto Tamassia.
     Algorithm Design: Foundations, Analysis, and Internet Examples.
     John Wiley & Sons, Inc., Hoboken, NJ, 2002.
  2. Volker Heun.
     Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
     2nd edition, Vieweg, Braunschweig-Wiesbaden, 2003.
  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
     Introduction to Algorithms.
     2nd edition, MIT Press, Cambridge, MA, 2001.
  4. Jon Kleinberg, Eva Tardos.
     Algorithm Design.
     Pearson Education, Boston, MA, 2005.
  5. Uwe Schöning.
     Algorithmik.
     Spektrum Akademischer Verlag, Heidelberg, 2001.
  6. Robert Sedgewick.
     Algorithmen in Java. Teil 1-4.
     3rd, revised edition, Pearson Education, München, 2003.
• Office Hours:
  Look here