After successful completion of the course, students are able to analyze basic algorithms for data structures and graphs (such as trees) with the help of mathematical methods, in particular for the average case.
Methods and concrete examples for the analysis of algorithms and data structures.
Generating functions, combinatorial identities, asymptotic methods.
First meeting: Wednesday, 19th October, 4pm at SEM.R. DA grün 05
The grade consists of the number of solved exercises, the quality of the presentations as well as the exam.