The course gives an overview on basic concepts of data structures and general principles of algorithmic design. The general algorithmic paradigms will be examined based on the classical problems of searching, sorting and classical graph problems like shortest path or minimal spanning trees. Finally, the course will give an introduction to the general methodology of programming.
- Trainer/in: Julian Busch
- Trainer/in: Matthias Schubert
- Trainer/in: Thomas Seidl
- Trainer/in: Max Berrendorf
- Trainer/in: Sebastian Schmoll
- Trainer/in: Matthias Schubert
- Trainer/in: Niklas Strauß
- Trainer/in: Christian Frey
- Trainer/in: Thomas Seidl
- Trainer/in: Giacomo De Nicola
- Trainer/in: Catharina Hollauer
- Trainer/in: Göran Kauermann
- Trainer/in: Christoph Striegel
The course content is currently available here.
- Trainer/in: Francois Bry
- Trainer/in: Andreas Butz
- Trainer/in: Yingding Wang