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.
The grade consists of the presentations at the blackboard as well as the number of solved excercises.
If required the limit on the number of participants will be increased