Fundamental Algorithms - Winter 13: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo edit summary |
||
| Line 7: | Line 7: | ||
| tutorials = --- | | tutorials = --- | ||
| exam = written exam at end of semester | | exam = written exam at end of semester | ||
| tumonline = https://campus.tum.de/tumonline/wbStpModHB.detailPage?&pKnotenNr=458187 | | tumonline = https://campus.tum.de/tumonline/wbStpModHB.detailPage?&pKnotenNr=458187 (module description) | ||
}} | }} | ||
Revision as of 15:06, 23 June 2013
- Term
- Winter 13
- Lecturer
- Prof. Dr. Michael Bader
- Time and Place
- t.b.a.
- Audience
- Computational Science and Engineering; Biomedical Computing (elective)
- Tutorials
- ---
- Exam
- written exam at end of semester
- Semesterwochenstunden / ECTS Credits
- 2 SWS (2V) / 3 ECTS
- TUMonline
- https://campus.tum.de/tumonline/wbStpModHB.detailPage?&pKnotenNr=458187 (module description)
Contents
The course will provide an overview on the analysis of fundamental 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
- Algorithms on (weighted) graphs: traversals, shortest paths, etc.
Announcements
Lecture Notes and Material
will be made available here throughout the lecture ...
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