Lectures/Assignment Timetable

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.

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

Lecture/Assignment Date Topic
1 2023-10-31 15:15-17:00 Introduction to the course and revision of Algorithm analysis
2 2023-11-02 13:15-15:00 Divide and Conquer and Algorithm analysis
3 2023-11-03 10:15-12:00 Revision of Graphs, and the Python API for the assignments (Frej Knutar Lewander)
4 2023-11-06 13:15-15:00 Dynamic Programming - Introduction
Help 1a 2023-11-07 15:15-17:00
5 2023-11-10 10:15-12:00 Dynamic Programming - Knapsack
Help 1b 2023-11-14 08:15-10:00
Help 1c 2023-11-16 08:15-10:00
Deadline Assignment 1 2023-11-17 13:00
6 2023-11-21 10:15-12:00 Greedy Algorithms
Help 2a 2023-11-22 13:15-15:00
7 2023-11-23 13:15-15:00 Minimal Spanning Trees
Grading session Assignment 1 2023-11-27 By invitation only
8 2023-11-27 10:15-12:00 Network flows
Help 2b 2023-11-28 08:15-10:00
Solution Session Assignment 1 2023-11-28 10:15-11:00 Obs only 45 mins
9 2023-11-29 10:15-12:00 Networks flows, Bipartite matching
Help 2c 2023-11-30 15:15-17:00
Deadline Assignment 2 2023-12-01 15:00
10 2023-12-04 10:15-12:00 Union Find
Help 3a 2023-12-05 08:15-10:00
11 2023-12-07 08:15-10:00 String Matching
Solution Session Assignment 2 2023-12-08 15:15-16:00 Obs only 45 mins
12 2023-12-11 15:15-17:00 P vs NP (Pierre Flener)
Help 3b 2023-12-12 13:15-15:00
Help 3c 2023-12-13 08:15-10:00
13 2023-12-14 13:15-15:00 P vs NP (Pierre Flener)
Deadline Assignment 3 2023-12-15 13:00
Exam 2024-01-08 TBA
Next