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.

• 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, 28 September 2020, 10:15 am via Zoom. You can find the login credentials in the Portal2.

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.

Tuesday

• 12:00 - 13:30, Maximilian Schneider

Wednesday

• 08:30 - 10:00, Jan Bentz
• 13:45 - 15:15, Jan Bentz
• 13:45 - 15:15, Paul Masberg

Thursday

• 13:45 - 15:15, Paul Masberg
• 13:45 - 15:15, Maximilian Schneider

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