Algorithms & Complexity

Advanced Competitive Programming

General Information

  • Teaching Team: Marvin Künnemann-Goos, Sebastian Angrick
  • Language: English
  • Number of students: At most 30
  • Links: ILIAS-link coming soon!

Content

During the semester, algorithms and data structures are presented that are used in programming competitions due to their efficiency and comparatively short time required for implementation. For each topic (graphs, segment trees, strings, number theory, etc.), practical exercises must be implemented. Highlights of the course include contests in which students compete against each other under conditions similar to those found in actual competitions. The same course is offered at the Hasso Plattner Institute at the University of Potsdam under the name Competitive Programming 2. Exercises and live contests are synchronized, and there is a shared scoreboard.

Grading

The evaluation is based on programming exercises and live contests during the semester as well as a final contest after the end of the lecture period.

  • 40% programming exercises (to be submitted 2 weeks after the start of each topic)
  • 30% live contests (10% per contest)
  • 30% final contest (30% per contest)

Schedule

The course takes place on Fridays from 11:30 to 13:00 in room 301, building 50.34. Roughly every four weeks, there will be a joint contest with the students from Hasso Plattner Institute. Further information/materials are available on ILIAS.