This course presents the basic techniques needed to develop algorithms and to show their correctness using formal proofs. Algorithms and data structures for sorting, hashing, searching and graphs will be explained and their correctness will be proved.
In 2022 this course takes place as inverted lecture. The tutorials will take place in-person only.
Exercise sheets will be published weekly and discussed in the tutorials. The students are encouraged to participate in the tutorials to deepen their understanding in the lecture's topics.
You can find the exercise sheets in the corresponding folder of the ILIAS course.