|
Lecturer:
Prof. Dr. Ernst W. Mayr
Dr. Volker Heun
|
|
|
Area:
3+2 lectures per week in
Bachelor (compulsory course, first year)
complementary studies (compulsory course, second year)
|
|
|
Time and Place:
Tue 10h c.t. - 11:00, lecture hall 1601
Wed 8:30 - 10:00, lecture hall 0602
Start: 3. November
End: 29. February
|
|
|
Exercises:
2 hours per week exercises accompanying the lectures
Tue 14h c.t. - 15:45, lecture hall 0606
Teaching Assistant: Tom Friedetzky
Course Certificate: To get a course certificate students must
get at least 40% on the homework assignments and
pass the final exam.
The final exam has been written on March 1st, 2000, Lecture Hall
S0143 at 10am.
The make-up exam has been written on March 29th, 2000, Lecture Hall
S2229 at 10am.
Exams were closed book and closed notes.
Only nonprogrammable calculaters and one sheet of paper (A4) with
arbitrary contents were allowd.
|
|
|
Audience:
students in computer science (compulsory studies)
|
|
|
Prerequisites:
Basic knowledge in computer science
|
|
|
Recommended for:
Fundamental knowledge in topic Algorithms
|
|
|
Contents:
Preliminary Schedule
- Fundamentals
Models of Computation, Complexity Measures
- 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
- Artithmetic Problems
Euclidean Algorithm, Multiplication of Integers,
...
|
|
|
Related and Advanced Lectures:
|
|
|
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
|
|
