|
Lecturer:
Prof. Dr. Ernst W. Mayr
Volker Heun
|
|
|
Area:
3+2 lectures per week in
complementary studies
compulsory course
|
|
|
Time and Place:
Wed 8:30 - 10:00, lecture hall 1260 (5/5 only)
Tue 8:30 - 10:00, lecture hall 0220 (from 5/11)
Wed 12h c.t. - 13:00, lecture hall 2760
Start: 5. May
End: 28. July
|
|
|
Exercises:
2 hours per week exercises accompanying the lectures
Wed 15h c.t. - 16:45,
room S2225
Teaching Assistant: Michal Mnuk
Course Certificate: To get a course certificate students must
pass the final exam.
Admission to the final exam requires an oral presentation of one of
the exercises.
|
|
|
Audience:
students in computer science (compulsory studies)
|
|
|
Prerequisites:
Basic knowledge in Computer Science
|
|
|
Recommended for:
Fundamental knowledge in topic Algorithms
|
|
|
Contents:
- Fundamentals
Models of Computation, Complexity Measures
- Sorting
Merge-Sort, Heap-Sort, Quick-Sort, Bucket-Sort,
Lower Bounds
- Selection
BFPRT-Algorithm, Randomized Median-Algorithm
- Searching
Hashing, Search Tress, String Matching
- Graph Algorithms
Transitive Closure, Shortest Path Problems,
Minimum Spanning Trees
- Artithmetic Problems
Euclidean Algorithm, Multiplication of Integers,
...
|
|
|
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
|
|
