Lectures Algorithms and
Data Structures (EI) Efficient Algorithms and
Data Structures I Gems of Informatics III Proseminar Algorithms for daily life Seminar IT-Security Threats Lab Course Design of Algorithms Courses for PhD Students

Algorithms and Data Structures (EI)

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module: IN8009
• News:
  1. +++ Final: Tuesday, February 17, 2009, 11:00 o'clock, Makeup Final: Tuesday, April 7, 2009, 9:00 o'clock
     For further details see the German version of this page +++
• Area:
  4+2 lectures per week
• Time and Location:

  Monday, 09:15-10:45, 1200 Carl von Linde Hörsaal Thursday, 08:15-09:45, 1200 Carl von Linde Hörsaal

  First Lecture: Thursday, October 16, 2008 First Lab Meeting, Programming C: Wednesday, October 15, 2008, see http://www.ldv.ei.tum.de/studium/vorlesungen/pic/

• Exercises:

  2 hours per week exercises accompanying the lectures Wednesday, 10:30-12:00, 1200 Carl von Linde Hörsaal Teaching Assistant: Dmytro Chibisov und Dr. Stefan Schmid

  First Exercise: Wednesday, October 22, 2008

• Course Certificate:
  To get a course certificate students must pass the final exam.
• Audience:
  Students in electrical engineering and information technology
• ECTS: 6 points
• Prerequisites:
  Basic knowledge of mathematics
• Contents
• Slides: (last modified February 8, 2009)
  

  Oktober:		October 16, 2008
  	October 20, 2008	October 23, 2008
  	October 27, 2008	October 30, 2008
  November:	November 3, 2008	November 6, 2008
  	November 10, 2008	November 13, 2008
  	November 17, 2008	November 20, 2008
  	November 24, 2008	November 27, 2008
  December:	December 1, 2008
  	December 8, 2008	December 11, 2008
  	December 15, 2008	December 18, 2008
  	December 22, 2008
  January:		January 8, 2009
  	January 12, 2009	January 15, 2009
  	January 19, 2009	January 22, 2009
  	January 26, 2009	January 29, 2009
  February:	February 2, 2009	February 5, 2009

  
  And here you get everything in one file! 
• Lecture Notes: none, see slides above
• References:
  Contents of this course are essentially covered by the following books:
  1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.
     The design and analysis of computer algorithms
     Addison-Wesley Publishing Company: Reading (MA), 1974
  2. Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein
     Introduction to algorithms
     McGraw-Hill, 1990
  3. Hartmut Ernst
     Grundkurs Informatik: Grundlagen und Konzepte für die erfolgreiche IT-Praxis – Eine umfassende, praxisorientierte Einführung
     Vieweg Verlag: Braunschweig-Wiesbaden, 3. Auflage, 2003
  4. Volker Heun
     Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen
     2. Aufl., Vieweg: Braunschweig-Wiesbaden, 2003
  5. John E. Hopcroft, Jeffrey D. Ullman
     Introduction to Automata Theory, Languages, and Computation
     Addison-Wesley Publishing Company: Reading (MA), 1979
  6. Donald E. Knuth
     The art of computer programming. Vol. 1-3
     3. Auflage, Addison-Wesley Publishing Company: Reading (MA), 1997
  7. Kurt Mehlhorn, Peter Sanders
     Algorithms and Data Structures – The Basic Toolbox
     Springer-Verlag: Berlin-Heidelberg, 2008
  8. Steven S. Skiena
     The algorithm design manual
     Springer-Verlag: Berlin-Heidelberg-New York, 1998
• Office Hours:
  Mo., 8:15-9:15, 1200 Carl von Linde Hörsaal