Fundamental Algorithms - Winter 09: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 17: | Line 17: | ||
* Artithmetic Problems: parallel prefix computation, parallel matrix and vector operations | * Artithmetic Problems: parallel prefix computation, parallel matrix and vector operations | ||
* Graph Algorithms: Transitive Closure, Shortest Path Problems, Minimum Spanning Trees (if time allows) | * Graph Algorithms: Transitive Closure, Shortest Path Problems, Minimum Spanning Trees (if time allows) | ||
= Lecture Notes and Material = | |||
== Slides from the Lecture == | |||
; Introduction - Algorithms, Fibonacci example, growth of functions : Oct 30 | |||
: [http://www5.in.tum.de/lehre/vorlesungen/fundalg/slides/fundalg01.pdf slides] | |||
== Worksheets == | |||
; Growth of functions : Oct 30 | |||
: [http://www5.in.tum.de/lehre/vorlesungen/fundalg/worksheets/fundalg2.pdf slides] | |||
== Further Material == | |||
* [http://www.cse.tum.de/vtc/FundAlg/index.html Lecture notes (on CSE Teaching Centre)] | |||
== Literature == | |||
* Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, MIT Press | |||
* Heun: Grundlegende Algorithmen, Vieweg 2000 | |||
* Sedgewick: Algorithms, Pearson Education | |||
* Shackleford, Computing and Algorithms, Addison Wesley Longman | |||
* Kleinberg, Tardos: Algorithm Design, Pearson Education | |||
Revision as of 07:47, 30 October 2009
- Term
- Winter 09
- Lecturer
- Dr. Michael Bader
- Time and Place
- Friday, 9-11, lecture hall MI 00.13.009A (first lecture: Oct 30)
- Audience
- Computational Science and Engineering, 1st semester (Module IN2005); Biomedical Computing
- Tutorials
- -
- Exam
- written exam (t.b.a.)
- 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.
- Artithmetic Problems: parallel prefix computation, parallel matrix and vector operations
- Graph Algorithms: Transitive Closure, Shortest Path Problems, Minimum Spanning Trees (if time allows)
Lecture Notes and Material
Slides from the Lecture
- Introduction - Algorithms, Fibonacci example, growth of functions
- Oct 30
- slides
Worksheets
- Growth of functions
- Oct 30
- slides
Further Material
Literature
- Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, MIT Press
- Heun: Grundlegende Algorithmen, Vieweg 2000
- Sedgewick: Algorithms, Pearson Education
- Shackleford, Computing and Algorithms, Addison Wesley Longman
- Kleinberg, Tardos: Algorithm Design, Pearson Education