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

Tutorial for Fundamental Algorithms (WS 07/08)

In English

• Course Details
  Main page for the course

• Tutorial
  Sandeep Sadanandan

• Time and Place
  Wednesday 11:00-12:30, room MI 03.11.018
  

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

• Prerequisites
  Material taught in the course

• 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 Lectures
  
  • Fundamental Algorithms '05/'06
  • Fundamental Algorithms '02/'03
  • Grundlegende Algorithmen '05/'06 (in German)
  • Efficient Algorithms and Data Structures '06/'07 (in German)
• Tutorial Notes
  Problem sheet for the next tutorial exercise will be available four days earlier. The solution sheet will be provided after the respective tutorials.

  Exercise 01	Problems	Solutions
  Exercise 02	Problems	Solutions
  Exercise 03	Problems	Solutions
  Exercise 04	Problems	Solutions
  Exercise 05	Problems	Solutions
  Exercise 06	Problems	Solutions
  Exercise 07	Problems	Solutions
  Exercise 08	Problems	Solutions
  Exercise 09	Problems	Solutions
  Quiz	Problems	Solutions
  Exercise 11	Problems	Solutions

• References
  
  • 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.
  • S Dasgupta, C H Papadimitriou and U V Vazirani, Algorithms, http://www.cse.ucsd.edu/users/dasgupta/mcgrawhill/

• Office Hours
  sadanand[at]in.tum.de (by appointment)

  ---

  Sandeep Sadanandan