Algorithms: Design, Analysis and Implementation
After finishing the course the participants should know the most relevant design techniques for algorithms. They know how to use them as guidelines in the the creative process of designing new algorithms in diverse areas and using diverse data structures. They know how to analyse the algorithms, how to provide generic implementations in modern programming languages and if appropriate how to realize them as components of a library. They are able to present and to defend their decisions in critical discussion.
Vorlesung 2 SWS, Übung 2 SWS
Examination: written exam
- S. Skiena: The Algorithm Design Manual, Springer
- A. Levitin: The Design and Analysis of Algorithms, Pearson
- C. Moore, S. Mertens: The Nature of Computation, Oxford UP