back to search
You will learn the fundamentals of analyzing algorithms as well as central data structures and fundamental algorithmic problems. The focus is on runtime and space analysis, various search trees, hashing methods, priority queues, union-find structures, as well as maxflow/mincut and matching algorithms. In the end you will be able to analyze algorithms, assess the efficiency of data structures, and design new solutions for problems.
From the current semester, not binding. You attend one of several groups; the timetable automatically suggests the one with the fewest clashes.
No ratings for this module yet.
Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.
Reviews are automatically checked before they are published.
Official page in TUMonline · Details are not binding.