Fundamental Algorithms - Winter 11: Difference between revisions

From Sccswiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 5: Line 5:
| credits = 2 SWS (2V) / 3 Credits
| credits = 2 SWS (2V) / 3 Credits
| audience = Computational Science and Engineering, 1st semester (Module [http://drehscheibe.in.tum.de/myintum/kurs_verwaltung/cm.html?id=IN2157 IN2157]); Biomedical Computing
| audience = Computational Science and Engineering, 1st semester (Module [http://drehscheibe.in.tum.de/myintum/kurs_verwaltung/cm.html?id=IN2157 IN2157]); Biomedical Computing
| tutorials = t.b.a. (no compulsory tutorials
| tutorials = t.b.a. (no compulsory tutorials; there might be a few extra lessons on a voluntary basis)
| exam = written exam
| exam = written exam
}}
}}

Revision as of 08:59, 25 October 2011

Term
Winter 11
Lecturer
Prof. Dr. Michael Bader
Time and Place
Tuesday, 9:00-10:30, (MI 02.07.023); first lecture: Oct 25
Audience
Computational Science and Engineering, 1st semester (Module IN2157); Biomedical Computing
Tutorials
t.b.a. (no compulsory tutorials; there might be a few extra lessons on a voluntary basis)
Exam
written exam
Semesterwochenstunden / ECTS Credits
2 SWS (2V) / 3 Credits
TUMonline
{{{tumonline}}}



Contents

The course will provide an overview of fundamental algorithms and an introduction to the analysis of algorithms. Topics will be:

  • Fundamentals: Models of Computation, Complexity Measures
  • Sorting: Bubble-Sort, Merge-Sort, Quick-Sort, Median-Algorithms, Lower Bounds, etc.: sorting in parallel
  • Searching: Hashing, Search Tress, etc.
  • Arithmetic Problems: parallel prefix computation, parallel matrix and vector operations
  • Foundations of parallel algorithms and simple models of parallel computation

Lecture Notes and Material

Slides from the Lecture

Introduction - Algorithms, Fibonacci example
Oct 25
slides

Literature

  • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms; MIT Press
  • Berman, Paul: Algorithms: Sequential, Parallel, and Distributed; Cengage Learning Emea 2004
  • Heun: Grundlegende Algorithmen; Vieweg 2000
  • Sedgewick: Algorithms; Pearson Education
  • Shackleford, Computing and Algorithms; Addison Wesley Longman
  • Kleinberg, Tardos: Algorithm Design; Pearson Education