The exam is on May 23 and 24.
If you have other exams on one of the days and therefore are not able to participate that day, then send me an email before May 15.
We will send the list out shortly after that, so you know which day you are on.
As Friday is a Holiday this week, I will have office hours on Thursday instead (12.15-13).
In the mandatory exercises it says “Analyze the running time of a sequence of n Create-Tree and m Return-Depth and Merge-Tree operations in your data structure”.
That should be understood as ANY mixed sequence of n Create-Tree, m Return-Depth, and m Merge-Tree operations, i.e. the operations can be interleaved.
This week and the week after Easter I will have office hours on Thursday 12-13.
The deadline for the mandatory exercise from Week 6 is April 7th at 20:00.
We are searching for Msc. (or Bsc.) project students to work on plagiarism
detection in a system used by Danish high schools. The students should
have a strong background in algorithms and data structures. The project is
joint with a medium-size Danish software company who will supply the data.
If you are interested or know somebody interested, let me know.
There is an algorithms talk Thursday from 12-13 (see the algolog group mailing list). Therefore the office hours will be from 13-14.
- Philip and Inge.
I do not have office hours Friday this week. Instead I will have office hours on Thursday (26th) from 12.15 to 13.
There is an error in the mandatory assignment. Assignment 1.1. should be:
- Let c∗ be the cluster v is contained in in the optimal solution. Let z be a vertex assigned to c∗ in the optimal solution and that is in S in the iteration when v is chosen. Show that w(z) · d(z, v) ≤ 2r.
My office hours this week is moved to Thursday 12.10-13.
Here you can also get your score for week 7 (and probably also week 8).
It was the wrong version of the exercise file for week 7, that was on the blog. I’ve updated it, so it now contains the mandatory exercise. Please lose the old one.