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

Introduction to Computer Science IV (SS 06)

• Lecturer:
  Prof. Dr. Ernst W. Mayr

• Area:
  4 hrs lecture + 3 hrs tutorials,
  compulsory undergraduate course

• Time and Location:
  

  Mon	10:50 - 12:20	Lecture room MI HS 1
  Fri	08:30 - 10:00	Lecture room MI HS 1

• Tutorials: 3 SWS Problem Sessions
  Teaching Assistant(s): Hanjo Täubig

• Exams:
  

  Midterm:	Sat, 10.06.2006	10:00-12:00	MW 2001
  Final:	Sat, 22.07.2006	10:00-12:00	MW 2001
  Repeat:	Wed, 11.10.2006	09:00-12:00	MW 0001

  For details please refer to the German version of this web-site

• Audience:
  undergraduate students of computer science

• ECTS: 9 points

• Prerequisites:
  1st year courses

• Recommended for:
  Vordiplom

• Contents
  

• Related and Advanced Lectures:
  
  • Efficient Algorithms and Data Structures
  • Automata, Formal Languages, and Computability
  • Complexity Theory

• Slides:
  

  April:	April 24, 2006	April 28, 2006
  May:		May 5, 2006
  	May 8, 2006	May 12, 2006
  	May 15, 2006	May 19, 2006
  	May 22, 2006	May 26, 2006
  	May 29, 2006
  June:		June 2, 2006
  		June 9, 2006
  	June 12, 2006	June 16, 2006
  	June 19, 2006	June 23, 2006
  		June 30, 2006
  July:	July 3, 2006	July 7, 2006
  	July 10, 2006	July 14, 2006
  	July 17, 2006
  	July 24, 2006	July 28, 2006

• References:
  
  1. A.V. Aho, J.E. Hopcroft, J.D. Ullman:
     The Design and Analysis of Computer Algorithms, Addison-Wesley, 1976.
  2. A. Asteroth, Ch. Baier:
     Theoretische Informatik, Pearson Education, 2003.
  3. M. Broy:
     Informatik: eine grundlegende Einführung - Teil 4: Theoretische Informatik, Algorithmen und Datenstrukturen, Logikprogrammierung, Objektorientierung, Springer, 1996.
  4. Th.H. Cormen, Ch.E. Leiserson, R.L. Rivest, C. Stein:
     Introduction to Algorithms, 2nd ed., MIT Press, 2001.
  5. K. Erk, L. Priese:
     Theoretische Informatik: Eine umfassende Einführung, Springer, 2000.
  6. G. Goos:
     Vorlesungen über Informatik, Bd. 3, Berechenbarkeit, formale Sprachen, Spezifikationen, Springer, 1997.
  7. V. Heun:
     Grundlegende Algorithmen, Vieweg, 2000.
  8. J.E. Hopcroft, R. Motwani, J.D. Ullman:
     Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie, 2. Aufl., Pearson Education, 2002.
     Original: Introduction to Automata Theory, Languages, and Computation, 2nd ed., Addison-Wesley, 2001.
  9. Th. Ottmann, P. Widmayer:
     Algorithmen und Datenstrukturen, 3. Aufl., Spektrum Akademischer Verlag, 1996.
  10. U. Schöning:
      Theoretische Informatik - kurzgefasst, Spektrum Akademischer Verlag, 1997.
  11. I. Wegener:
      Theoretische Informatik, Teubner, 1993.

• Office Hours:
  look here