Computer Science Department - Technische Universität München Chair for Efficient Algorithms

Discrete Structures (WS 05/06)

• Lecturer:
  Prof. Dr. Ernst W. Mayr

• Area:
  4h lectures per week in undergraduate studies
  compulsory course

• Time and Place:
  Tuesday, 8:30-10:00, MW 2001
  Friday,    8:30-10:00, MW 1801
  First Lecture: Friday, October 21, 2005 because of SET

• Exercises:
  2 hours per week tutorials accompanying the lectures.
  Teaching Assistant: Dr. Werner Meixner.
  Registration for the tutorials is via https://grundstudium.informatik.tu-muenchen.de/.
  You need a user certificate of the RBG.

• Course Certificate:
  To obtain a course certificate students must pass the written exam (administered in two parts, midterm and final).
  

• Examinations:
  Where in line with the Fachprüfungsordnung, it is necessary to achieve 40 per cent of the homework points in order to be admitted for the written exam.

  Midterm:	Saturday, 10.12.2005	09:00-11:00
  Final:	Saturday, 04.02.2006	09:00-11:00
  Repetition:	Saturday, 22.04.2006	09:00-12:00

  We allow inspection for written examinations on Thursday, February 23, 2006 (room MI HS 1).

  You can sign up for the Repetition (with the usual certificate, March 24 to April 14, 2006) via the following address: https://grundstudium.informatik.tu-muenchen.de/
  

  The exam is closed book. Only one handwritten A4 format sheet of notes is allowed.

• Audience:
  undergraduate students of computer science
  students with computer science as minor

• Prerequisites:
  

• Recommended for:
  Bachelor / Vordiplom

• Contents
  

• Related and Advanced Courses:
  Discrete Probability Theory (Bachelor) resp. Discrete Structures II (Vordiplom)

• Slides:
  

  October:		October 21, 2005
  	October 25, 2005	October 28, 2005
  	Quiz 10/28/05	Solutions Quiz 10/28/05
  November:		November 04, 2005
  	November 08, 2005	November 11, 2005
  	November 15, 2005	November 18, 2005
  	November 22, 2005	November 25, 2005
  	November 29, 2005
  December:		December 2, 2005
  	December 6, 2005	December 9, 2005
  	December 13, 2005	December 16, 2005
  	December 20, 2005	December 23, 2005
  January:	January 10, 2006	January 13, 2006
  	January 17, 2006	January 20, 2006
  	January 24, 2006	January 27, 2006
  	January 31, 2006
  February:		February 3, 2005
  		February 10, 2006

• 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