This course is intended for highly motivated students with a keen interest in algorithm development and programming in C++.
The topic of competitive programming deals with the finer bits of programming that come to light when programming is done in a competitive context.
Aiming to fully optimize both time and memory usage, a combination of cleverly designed data structures and efficient routines can lead to the very best solution of a particular precisely defined problem.
Building on basic knowledge of elementary datastructures, sorting and search algorithms, we dive into the finer algorithmic aspects of graphs, trees, paths, circuits and flows and cover topics such as number theory , combinatorics, geometry and string algorithms.
All of this with the aim of building a set of knowledge and skills that will ultimately allow us to, in a competitive environment, solve a problem as efficiently and quickly as possible.
Learn how to quickly assess which algorithm is suitable for solving which type of problem;
Understand how to optimize, improve and streamline an algorithm in order to maximize its computational efficiency;
Be able to understand a complex solution to a problem, and explain its workings to others;
Learn how to work together in a small team to tackle a set of problems in as little time as possible;
Have the basic knowledge and skills to successfully participate in a programming contest.
The most recent timetable can be found on the students' website.
Mode of instruction
Lectures, lab sessions, assignments, contests and student presentations.
Total hours of study: 168 hrs. (= 6 EC)
Lectures: 28:00 hrs.
Assignments: 56:00 hrs.
Project (presenation, programming, paper): 84:00 hrs.
One individual assignment (20%)
A presentation and short report on a paper (35%)
Three evaluated rounds of programming contests done in pairs (45%)
- Papers will be distributed during the course.
- You have to sign up for courses and exams (including retakes) in uSis. Check this link for information about how to register for courses.
- to be released.