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 2024 this course takes place as inverted lecture. The tutorials will take place in-person only.

• Contact via email to linda.scheu-hachtelmail-uni-mannheim.de

• Lecture recordings are going to be available in the ILIAS course.
• In 2024 this course takes place as inverted lecture.
• Each Monday, unless stated otherwise, there is going to be a discussion about the content of lectures at 10:15h in room B6, A001. If the time is not sufficient, there will also be a discussion on Wednesday, 10:15h in room A5, B144.
• The first lecture regarding the structure of the course will take plance on Monday, 02.09.24 at 10:15h in room B6, A001.
• If it is necessary, there will be an exercise session on Thursday, 17.15h in room A5, B144 regarding basic concepts. These dates will be communicated via E-mail.

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.

Tuesday

• 12:00h-13:30h; B6 26 A 104

Wednesday

• 08:30h-10:15h; B6 26  A 104

Thursday

• 13:45h – 15:15h; B6 26  A 1.04

Friday

• 10:15h-11:45h; B6 26 A 1.04

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