This basic course explains the basics of algorithms and complexity. It assumes only knowledge of basic mathematics (set and logic notation, linear algebra, proof by induction, probability theory, big-O notation).
Lecturers: Marie Schmidt (firstname.lastname@example.org) and Tom van der Zanden (T.vanderZanden@maastrichtuniversity.nl)
Acknowledgement: Much of the material used in this course was previously developed by Gerhard Woeginger and Jesper Nederlof.
Exercises (four series)
(If you have questions, send the lecturer an email or ask on Monday)
Important: comments on the homework
Note: For those lacking background in algorithms design, we recommend to (at least) browse through the first 3 chapters of `Introduction to Algorithms’ by Cormen, Leiserson, Rivest and Stein
If you are not yet familiar with "graphs" or want to refresh your knowledge, please watch this video (slides) before the first lecture on September 13.
Summary of lectures