Computer Science Department
Technische Universität München
Efficient Algorithms and Data Structures I
Prof. Dr. Christian Scheideler
4+2 lectures per week in area III (Theoretical Computer Science)
core course, topic algorithms
Time and Place:
Tuesday, 8:30-10:00, MW 1801
Friday, 10:15-11:45, MI HS 1
web page [in German]
2 hours per week exercises accompanying the lectures
Friday, 12:05-13:35, MI HS 1
To get a course certificate students must pass the exams (midterm and final).
graduate students of computer science
students with computer science as minor
1st and 2nd year courses
Fundamental knowledge in topic Algorithms
This lecture deals in particular with the following topics:
Basic Data Structures
Search Trees and Skip Lists
Sorting, Sets, and Selection
Algorithms on Graphs
Network Flow and Matching
Related and Advanced Lectures:
Efficient Algorithms and Data Structures II
WS 98/99 lecture notes
by Prof. Mayr. Additional chapters:
Perfect Hashing (in
The course outline can be found in the following book:
Michael T. Goodrich, Roberto Tamassia.
Algorithm Design: Foundations, Analysis, and Internet Examples.
John Wiley & Sons, Inc., 2002.
Complementary and additional in-depth material can be taken from:
Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein.
Introduction to Algorithms.
2nd edition, The MIT Press, Cambridge, MA, 2001.
Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
2nd edition, Vieweg, Braunschweig-Wiesbaden, 2003.
Donald E. Knuth.
The Art of Computer Programming: Fundamental Algorithms.
3rd edition, Addison-Wesley, Reading, MA, 1997.
Donald E. Knuth.
The Art of Computer Programming: Sorting and Searching.
2nd edition, Addison-Wesley, Reading, MA, 1997.
Spektrum Akademischer Verlag, Heidelberg, 2001.
2nd edition, Pearson Education, München, 2002.