Algorithms and Data Structures

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.

• Contact via email to algodat(at)uni.ma.

• Lecture recordings available in the ILIAS course: http://ilias.algodat.uni.ma/
• The first lecture takes place on Monday, 05 September 2022, 10:15 am in room A5, B144.
• In 2022 this course takes place as inverted lecture.

You can find the lecture slides in the corresponding folder of the ILIAS course.

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.

Monday

• 13:45 – 15:15, B6 26 – A 1.04, Thomas Thielen

Tuesday

• 12:00 – 13:30, B6 26 – A 1.04, Thomas Thielen

Wednesday

• 08:30 – 10:00, B6 26 – A 2.03, Salome Heckenthaler

Thursday

• 13:45 – 15:15, B6 26 – A 3.02, Salome Heckenthaler

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms – Third Edition, MIT Press, 2009.