Fundamental Algorithms - Winter 09: Difference between revisions
Jump to navigation
Jump to search
(Created page with '{{Lecture | term = Winter 09 | lecturer = Dr. Michael Bader | timeplace = Friday, 9-11, lecture hall MI 00.13.009A | credits = 2 SWS (2V) / 3 Credits | audience…') |
No edit summary |
||
| Line 2: | Line 2: | ||
| term = Winter 09 | | term = Winter 09 | ||
| lecturer = [[Michael Bader|Dr. Michael Bader]] | | lecturer = [[Michael Bader|Dr. Michael Bader]] | ||
| timeplace = Friday, 9-11, lecture hall MI 00.13.009A | | timeplace = Friday, 9-11, lecture hall MI 00.13.009A (first lecture: Oct 30) | ||
| credits = 2 SWS (2V) / 3 Credits | | credits = 2 SWS (2V) / 3 Credits | ||
| audience = Computational Science and Engineering, 1st semester (Module [https://www.in.tum.de/myintum/kurs_verwaltung/cm.html?id=IN2005 IN2005]); Biomedical Computing | | audience = Computational Science and Engineering, 1st semester (Module [https://www.in.tum.de/myintum/kurs_verwaltung/cm.html?id=IN2005 IN2005]); Biomedical Computing | ||
Revision as of 11:10, 22 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)