English

Vid tillräcklig efterfrågan

The course's objective is to provide participants with an increased understanding of algorithms and their practical applications in C/C++.

The course is offered as a seminar series. The following subjects will be covered: dynamic programming, graph algorithms, square root techniques, flows, matchings, cuts, Fenwick, segment trees, treaps, topological sorting, tries, suffix arrays, and computational game theory.

have a comprehensive understanding of the syntax, semantics, and type system of the C/C++ -programming languages.
understand theoretical algorithms and their time complexity.

independently solve a variety of practical problems with the correct time complexity.
be able to identify the problem class to which a given problem belongs.
create a conceptual solution to a given problem and assess whether C/C++ is a suitable option.

Seminarier

Litteraturkurs som självstudier

The course is provided as a seminar series of a total of 14 meetings.

Inlämningsuppgifter

Each week, a set of around 10 tasks will be presented for the students to solve, and these will serve as the students' examinations.

Underkänd, godkänd

Basic knowledge of complexity theory, good coding practices, and algorithms.

Laaksonen, A.: Guide till Tävlingsprogrammering: Lära och förbättra algoritmer genom tävlingar. Springer Nature Computer Science, 2020. ISBN 9783030393571.

FRT310F

2023-10-23

Maria Sandsten