- Module IN2157
- Lecture: Tuesday 8:25 - 9:55 in MI HS2 (starting on Oct 24 due to the "Introductory week")
- Tutorials: Wednesday 12-14 in 02.13.010 and 16-18 03.09.014
- Language: English

- Feb 28: As previously announced, no cheat sheets are allowed during the exam.
- Oct 24: Tutorials information updated.

- 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

- Lecture 1 (annotated versions 1 and 2)
- HExercise sheet 1
- Solution to Homework 1
- Lecture 2 and annotated version
- Exercise sheet 2
- Solution to Homework 2
- Exercise sheet 3
- Solution to Homework 3
- Lecture 3 and annotated version
- Exercise sheet 4
- Solution to Homework 4
- Lecture 4 and annotated version
- Exercise sheet 5
- Solution to Homework 5
- Lecture 5 and annotated version
- Exercise sheet 6
- Solution to Homework 6
- Lecture 6 and annotated version
- Exercise sheet 7
- Solution to Homework 7
- Lecture 7 and annotated version
- Exercise sheet 8
- Solution to Homework 8
- Exercise sheet 9
- Solution to Homework 9
- Lecture 8 and annotated version and the second part of the lecture as a ppt
- Lecture 9 and annotated version
- Material on network flows (Lecture 10 discussed pp. 1-40)
- Last Lecture
- Exercise sheet 10
- Solution to Homework 10
- Exercise sheet 11
- Solution to Homework 11
- Exercise sheet 12
- Solution to Homework 12
- Exercise sheet 13
- Solution to Homework 13