Computer Science Department
Technische Universität München
Tutorial for Fundamental Algorithms (WS 06/07)
Main page for the course
Time and Place
Monday 12:15-13:45, room 03.11.018
Computational Science and Engineering
(Master of Science).
Material taught in the course
Fundamentals - models of computation, complexity measures, Landau notation
Sorting - insertion/merge/heap/quick-sort
Searching and Trees - binary search, search trees, AVL trees, (2,3)-trees
Heaps and Priority Queues
Graph Algorithms - depth first search, breath first search, shortest path problems, minimum spanning trees
Arithmetic Problems - euclidean algorithm, multiplication of integers
Fundamental Algorithms '05/'06
Fundamental Algorithms '02/'03
Grundlegende Algorithmen '05/'06 (in German)
Efficient Algorithms and Data Structures '06/'07 (in German)
The problems and solutions are removed for the time being - because of the preparations for the current semester course -- Will appear after the trouble shooting
Problem sheet for the next tutorial exercise will be available four days earlier. The solution sheet will be provided after the respective tutorials.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
Introduction to Algorithms,
2. Print, MIT Press, Cambridge, MA, 2001.
2. Print, Pearson Education, Munich, 2002.
S Dasgupta, C H Papadimitriou and U V Vazirani,
sadanand[at]in.tum.de (by appointment)