Note: this public webpage only contains “static knowledge” that will not change during the semester. All data, information, news, etc. will be made available via Wattle. So you will not miss anything if you carefully check out this public webpage once, and then stick to Wattle afterwards.

Content

This course is offered in S2 2023 by Ahad N. Zehmakan and Pascal Bercher, and it covers the following material:

  • Week 1: Asymptotic Analysis
  • Week 2: Recurrence Analysis
  • Week 3: Search Problems
  • Week 4: Probabilistic Analysis
  • Week 5: Sorting Algorithms
  • Week 6: Binary Search Trees, Heaps, AVL Trees
  • Week 7: Red-Black Trees
  • Week 8: Hash Tables
  • Week 9: Introduction to Dynamic Programming
  • Week 10: Advanced Dynamic Programming
  • Week 11: Greedy Algorithms
  • Week 12: Complexity Theory

Ahad teaches weeks 1-5 and 9-11 and Pascal teaches weeks 6-8 and 12.

If you’re stuck, then you can reach out for help anytime—the course help page or course forum is a good place to start.

bars search times arrow-up