Course Syllabus for

Pragmatic Programming
Pragmatisk programmering

FRT310F, 7.5 credits

Valid from: Autumn 2023
Decided by: Maria Sandsten
Date of establishment: 2023-10-23

General Information

Division: Automatic Control
Course type: Third-cycle course
Teaching language: English


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


Knowledge and Understanding

For a passing grade the doctoral student must

Competences and Skills

For a passing grade the doctoral student must

Course Contents

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.

Course Literature

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

Instruction Details

Types of instruction: Seminars, self-study literature review. The course is provided as a seminar series of a total of 14 meetings.

Examination Details

Examination format: Written assignments. Each week, a set of around 10 tasks will be presented for the students to solve, and these will serve as the students' examinations.
Grading scale: Failed, pass

Admission Details

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

Course Occasion Information

Contact and Other Information

Course coordinators:
Web page:

Complete view