Lectures

Lecture, help sessions and grading sessions information

There is a menu item for each lecture where you can find a reading guide for the textbook, and links to additional material.

Please note that this timetable is still preliminary and is subject to change. The official timetable is in timeedit.

For the lecture locations please look at timeedit timeedit schedule is always correct. If there are any discrepancies between this page and timeedit, then please inform me.

Lecture/AssignmentDateTopic
12026-11-03 8-10Introduction to the course and revision of Algorithm analysis
22026-11-04 10-12Revision of Graphs, and the Python API for the assignments (Frej Knutar Lewander)
32026-11-06 10-12Dynamic Programming - Introduction
Help 1a2026-11-06 13-15
42026-11-09 13-15Dynamic Programming - Knapsack
Help 1b2026-11-10 13-15
Help 1c2026-11-11 8-10
52026-11-13 10-12Greedy Algorithms
Deadline Assignment 12026-11-14 15:00
62026-11-17 10-12Minimal Spanning Trees
Help 2a2026-11-18 13-15
Grading session Assignment 1TBABy invitation only
72025-11-20 13-15Network flows
Help 2b2025-11-23 10-12
Solution Session Assignment 12026-11-25 09-10Obs only 45 mins
82025-11-25 13-15Networks flows, Bipartite matching
Help 2c2025-11-26 10-12
Deadline Assignment 22026-11-27 15:00
92026-12-02 10-12Union Find
Help 3a2026-12-07 8-10
102026-12-9 8-10P vs NP
Help 3b2026-12-14 10-12
112026-12-15 13-15P vs NP
Solution Session Assignment 22026-12-18 9-10Obs only 45 mins
Help 3c2026-12-18 13-15
Exam2027-01-08For time and place please check Ladok
Deadline Assignment 32027-01-15 15:00