CS 566 – Efficient Algorithms (Winter 2024)
This is an archived version of this module from Winter 2024-25.
Efficient Algorithms (CS 566) is a second module in algorithms (Aufbaumodul) that covers common strategies for designing algorithms and data structures, illustrated through a variety of examples. While the selection of examples takes their relevance in applications into account, the module also focuses at teaching formal techniques for proving correctness and performance guarantees.
Quick links
Slido ⋅ Live ⋅ ILIAS ⋅ Campuswire ⋅ Question Gallery ⋅ Units
Teaching Evaluation
Below are the results of the University’s end-of-module survey.
Taking CS 566 for conditional admission to an international MSc program?
$\longrightarrow$ Read
“CS 566 for Credit vs. for conditional admission”!
Lectures
There will be synchronous interactive lectures, starting from October 14. Live participation is expected; recordings will be available on a best-effort basis.
Our regular lecture slots are
- Monday 16:15 – 18:00 in Hörsaalgebäude H|05, Hörsaal B;
- Tuesday 14:15 – 16:00 in Hörsaalgebäude H|05, Hörsaal D;
Units
The module will consist of the following units; each has unit subpage linked in the table with slides, lecture notes, and video recordings for that unit.
Tutorials (Übungen)
There will be small-group tutorials, organized by Nikolaus Glombiewski and Hannes Feil. The first tutorial classes will be held in the week of October 21.
Online Tools
We will use several tools and services that have proven effective in this module.
Campuswire
Campuswire is our main online communication channel.
Any questions relating to the module should be posted on Campuswire on the question & answer forum, the “class feed”. You can post anonymously if you prefer, and you are encouraged to answer each other’s questions, as well!
You can also use the platform for (social or topical) discussions in the chat rooms.
ILIAS
We will use the university’s official learning management system ILIAS for announcements and examination-related information.
Slido
During the live lectures, I will use Slido to for interactive parts.
Exam Question Gallery
We maintain a collaborative exam question gallery on Papeeria Overleaf.
(You may have to create a free account.)
Join us in making this a great resource for preparation for the exam – and if your questions are good enough, they might end up inspiring the actual exam! This is also a chance to learn or practice some $\LaTeX{}$.
Exam & Assessment
The module mark is based on the final examination. To be admitted to the exam, you must achieve a passing grade in the tutorials.
More details will be given in class.
Exams will take place on the following dates.
- First Examination opportunity for-credit students: Tue 25 Feb 2025
- First Examination opportunity conditional-admission students: Sat 1 Mar 2025
- Second Examination opportunity for-credit students: Wed 26 March 2025
- Second Examination opportunity conditional-admission students: tbd
CS 566 for Credit vs. for conditional admission
The for-credit version of CS 566 is predominantly taken by students on the German undergrad programs in Marburg and is a compulsory module for the BSc Data Science program. It must hence be offered in German, including examinations.
If you are taking CS 566 to satisfy the prerequisites of a conditional admission to an international Master’s program, you will be offered a separate examination in English that is based on the provided English self-study material instead of the German lectures. You are, however, welcome and encouraged to attend lectures and tutorials, and in particular to join and use the Campuswire Q&A forum.
Note: If you are required to take the CS 566 prerequisite module as part of your admission, you cannot take CS 566 for credit in your program.
Further reading
There are many good algorithms textbooks, but no single definitive one that covers all topics of this module (in the way I want them presented!). Indeed, I have been cherrypicking the – in my opinion – most effective descriptions from a variety of sources; check the individual units for details.