Lectures Discrete Structures Efficient Algorithms and
Data Structures I Randomized Algorithms Proseminar Proofs from The Book Lab Course Algorithmen-Entwurf Courses for PhD Students Oberseminar

Discrete Structures

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module:
  IN0015, TUMonline
• Area:
  4h lectures per week in undergraduate studies
  compulsory course
• Time and Place:
  Tuesday, 13:45–15:15, MI HS1
  Thursday, 10:15–11:45, MI HS1
  
  The lecture on Thursday, February 2, 2012 is moved to Friday, January 27, 2012, 16:00–17:30, also in MI HS1.
  No class on December 8 (dies academicus).
  December 6, 2011: class cancelled!
  As of Tuesday, November 15, 2011, the lectures are no longer transmitted per video; all participants fit into MI HS1 !
  Additional and first lecture: Wednesday, October 19, 18:15–19:45, in MW 0001
• Exercises:
  2 hours per week tutorials accompanying the lectures.
  Teaching Assistant: Dr. Werner Meixner.
• Central exercises: (not mandatory)
  Wednesday, 17:45–19:15, MW 0001
  Dr. Werner Meixner.
  
• Course Certificate:
  To successfully complete the module students must obtain at least 40% of the points in the final (written) exam.
• Examinations:
  The exam is closed book, only one A4 format sheet of handwritten notes is allowed.
  For the dates, see the German webpage for the course.
• Audience:
  undergraduate students of computer science
  students with computer science as minor
• Prerequisites:
  -
• Recommended for:
  Bachelor
• Related and Advanced Courses:
  Discrete Probability Theory
• Slides:
  

  October:	October 19, 2011	October 20, 2011
  	October 25, 2011	October 27, 2011
  November:		November 3, 2011
  	November 08, 2011	November 10, 2011
  	November 15, 2011	November 17, 2011
  	November 22, 2011	November 24, 2011
  	November 29, 2011
  December:		December 1, 2011
  	December 6, 2011: (cancld)
  	December 13, 2011	December 15, 2011
  	December 20, 2011	December 22, 2011
  January:	January 10, 2012	January 12, 2012
  	January 17, 2012	January 19, 2012
  	January 24, 2012	January 26, 2012
  	January 27, 2012	January 31, 2012
  February:	February 7, 2012	February 9, 2012

  And here you get everything in one file! 
  (Some hints for using the above slides)
  
• References:
  

  Aigner:

  Diskrete Mathematik
  Vieweg, 1999 (3. Auflage).

  Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren:

  Concrete mathematics: a foundation for computer science
  Addison-Wesley, 1994.

  Gries, David und Schneider, Fred B.:

  A logical approach to discrete math
  Springer, 1993.

  Kreher, Donald L. und Stinson, Douglas R.:

  Combinatorial Algorithms: Generation, Enumeration, and Search
  CRC Press, 1999.

  Pemmaraju, Sriram und Skiena, Steven:

  Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica
  Cambridge University Press, 2003.

  Rosen, Kenneth H.:

  Discrete mathematics and its applications
  McGraw-Hill, 1995.

  Steger, Angelika:

  Diskrete Strukturen, Band 1: Kombinatorik, Graphentheorie, Algebra
  Springer, 2001.

• Office Hours:
  look here