Organization
Last offered | Summer Semester 2025 |
Lecturer | Prof. Stefan Roth, Ph.D., Prof. Dr. Zsolt István |
Assistants | Jan-Martin Steitz, Shaza Zeitouni |
Exam | Written exam |
See TuCAN link above for additional information (e.g., rooms & appointments), contact aud at visinf dot tu-darmstadt dot de for any questions |
- Data structures: Arrays, lists, binary search trees, B-trees, graph representations, hash tables, heaps
- Algorithms: Sorting algorithms, string matching, traversing, insertion, search, and deletion in data structures, shortest path search, minimum spanning trees
- Asymptotic complexity: runtime, Landau notation, classes P and NP, NP-completeness
- Algorithmic strategies, for example: divide-and-conquer, dynamic programming, brute force, greedy, backtracking, meta-heuristics