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.
- معلم: Julian Busch
- معلم: Matthias Schubert
- معلم: Thomas Seidl
- معلم: Max Berrendorf
- معلم: Sebastian Schmoll
- معلم: Matthias Schubert
- معلم: Niklas Strauß
- معلم: Giacomo De Nicola
- معلم: Catharina Hollauer
- معلم: Göran Kauermann
- معلم: Christoph Striegel
The course content is currently available here.
- معلم: Francois Bry
- معلم: Andreas Butz
- معلم: Yingding Wang