|
Lecturer:
Prof. Dr. Angelika Steger
|
|
|
Area:
4 hours per week in area III (Theoretical Computer Science)
core course
|
|
|
Time and Place:
Wed 10:15 - 11:45, Room N1070
Thu 08:30 - 10:00, Room 0360
Start: November 6th
|
|
|
Tutorials:
2 hours per week
Wed 08:30 - 10:00, Room S2229
Wed 12:15 - 13:45, Room 2770
Teaching Assistant:
Klaus Kühnle
Course Certificate: To get a course certificate students must
get at least 40% on the homework assignments and pass the final exam.
|
|
|
Audience:
3rd and 4th year students of computer science
students with computer science as minor
|
|
|
Prerequisites:
2nd year courses
|
|
|
Contents:
- basic notations, machine models, complexity measures
- higher level data structures
- basic algorithmic principles
- sorting and selection
- elementary graph algorithms
- unix commands fgrep and compress
|
|
|
Related and Advanced Lectures:
Efficient Algorithms and Data Structures II (SS97)
Parallel
Algorithms
Parallel Algorithms II
|
|
|
Lecture Notes:
Some attendees of the lecture are working on lecture notes.
The current version can be found here.
Some slides from the lecture:
|
|
|
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
-
Robert Endre Tarjan:
-
Data Structures and Network Algorithms
SIAM, Philadelphia, PA, 1983
|
|
|
Miscellaneous:
programming competition
|
|
|
Office Hours:
look here
|
