Computer Science Department - Technische Universität München Chair for Efficient Algorithms

Fundamental Algorithms (WS 05/06)

Lectures in English

• Lecturer:
  Jan Griebsch

• Area:
  2 lectures per week in Master of Science in Computational Science and Engineering (compulsory course).

• Time and Place:
  Mo, 12-14, room 03.11.018

• Audience:
  Students in Computational Science and Engineering (Master of Science).

• Prerequisites:
  Basic knowledge in computer science.

• Contents:
  
  • 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,

• Related and Advanced Lectures:
  
  • Fundamental Algorithms '02/'03
  • Fundamental Algorithms (in German)
  • Efficient Algorithms and Datastructures (in German)

• Lecture Notes:
  not available.

• References:
  
  • Volker Heun
    Grundlegende Algorithmen
    2. Auflage, Vieweg Verlag, 2003

  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
    Introduction to Algorithms.
    2. Print, MIT Press, Cambridge, MA, 2001.

  • Robert Sedgewick.
    Algorithms.
    2. Print, Pearson Education, Munich, 2002.

• Final Exam:
  when: February 10th, 2006, 10:00
  where: room 03.11.018

• Tutorial Questions: ps, pdf
  
• Tutorial incl. solutions (in German): ps, pdf
  
• Office Hours:
  by appointment