TUM INFO V - Fundamental Algorithms
[an error occurred while processing this directive]
Fundamental Algorithms - WS 2002/03
Lecturers:
Audience:
Lectures:
Time and Place
- Monday: 10-12, MI 02.07.023
- Tuesday: 12-13, MI 00.06.011
Exam:
- Midterm: Fri, Dec 13th, 14:00 in room MI 02.07.023
(for CSE students as a test exam!)
- Final:Mon, Feb 10th, 10:30 in room MI 02.07.023
Worksheets:
Contents:
- 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, ...
Tutorial:
Students in Computational Science and Engineering
are not required to attend a tutorial in "Fundamental Algorithms".
Therefore, an English speaking tutorial for "Fundamental Algorithms" will not be offered.
All students are invited to attend the tutorial in
"Grundlegende Algorithmen", instead
(Tue, 14-16, lecture hall PH HS 1, in German language).
The turorial is compulsory for Bachelor students (Informatik).
Worksheets:
Solutions to the exercises are also available (in German language only) on the
website of the German tutorials.
Literature:
For example:
- Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms
- Knuth: The Art of Computer Programming (Vol. 1-4, quite extensive)
- Sedgewick: Algorithms
- Shackleford: Computing and Algorithms
Michael Bader