LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Basic Algorithms (SS97)


* Lecturers:
Prof. Dr. Ernst W. Mayr
Volker Heun

* Area:
3 hours per week
compulsory course in complementary studies

* Time and Place:
Tue 12:00 - 13:00, Room 2750
Fri 09:00 - 11:00, Room 0606 (presumably N1070 after May 9th)
Start: 2nd May

* Tutorials:
2 hours per week
Mi 8:30-10:00, Room S2229
Teaching Assistant: Ulla Koppenhagen
Course Certificate: To get a course certificate students must present at least one exercise of the homework assignments and pass the final oral exam.

* Audience:
1st year students in computer science (complementary studies)

* Prerequisites:
Basic knowledge in computer science

* Contents:
  • Sorting
    Bubble-Sort, Merge-Sort, Heap-Sort, Quick-Sort, Radix-Sort, Median-Algorithms, Lower Bounds
  • Searching
    Hashing, Search Tress, String Matching
  • Graph Algorithms
    Transitive Closure, Shortest Path Problems, Minimum Spanning Trees
  • Algorithms for Artithmetic Problems
    Multiplication of Integers, Matrix Multiplication

* Lecture Notes:
Unfortunately, the lecture notes are no longer available, since they have been published.

* References:
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms
Addison-Wesley Publishing Company: Reading (MA), 1976
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:
Introduction to Algorithms
The MIT Press, 1990
Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen
Bibliographisches Institut, Reihe Informatik, Band 70,1990
Donald E. Knuth
The art of computer programming Vol. 3 : Sorting and searching
Addison-Wesley Publiching Company, Reading MA, 1973
Kurt Melhorn
Data structures and algoprithms 1 : Sorting and searching
EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984

* Office Hours:
look here


heun@informatik.tu-muenchen.de