Grundlegende Algorithmen (CSE)

What it is about

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.

What you will be able to do

• Understand fundamental sequential algorithms
• Understand simple parallel algorithms
• Analyze the complexity and parallelism of moderately complex algorithms
• Prove non-functional properties (correctness, parallelism) for known algorithms
• Evaluate the suitability of algorithms for given problems

What the module consists of

• VorlesungPresentation and discussion of the content
• TutorübungSolving concrete example problems and deepening, including group work

Teaching method

• VorlesungDelivery and discussion of the theoretical foundations
• Übungen/TutorienApplication and practice of analysis and proof techniques on examples
• SelbststudiumDeepening the lecture content using relevant literature