- Module IN2157
- Lecture: Tuesday 8:20 - 9:50 in MI HS2 (starting on Oct 16)
- Tutorial groups: Monday 16-18 in 03.09.014 (offered by
Chana and Pranav)
- Language: English
- Nov 27: Due to the extremely low attendance rate of the Wednesday exercise session we have to close it. The Monday session will run as usual and from now on will be the only one. According to the poll, it is generally acceptable to stick to Monday. For the exceptional cases where this is not possible, let me recall that we offer to correct the homework (even the past one) to gain the required level of practice.
Nov 26: In the next lecture, there would be an opinion poll (Lehrveranstalltungsevaluation).
Therefore, I'm looking forward to your numerous attendance and participation.
The course will provide an overview on the analysis of fundamental algorithms. The topics are the following:
Literature: Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms. MIT Press.
- Fundamentals: models of computation, complexity measures
- Sorting: Bubble-Sort, Merge-Sort, Quick-Sort, Median-Algorithms, lower bounds, 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.
For parallel algorithms, see Berman, Paul: Algorithms: Sequential, Parallel, and Distributed, or JaJa: Introduction to Parallel Algorithms
Here you can find animated executions of various algorithms.