back to search
You receive an introduction to fundamental sequential and simple parallel algorithms as well as the methods for their analysis. By the end you will be able to apply typical algorithms (sorting, searching, graph algorithms, some parallel arithmetic procedures), analyze their complexity and parallelism, and formally justify correctness and performance statements.
From the current semester, not binding.
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.