Update: Solution to the last exercise we discussed: https://goo.gl/j4Darh
================================================================
Update: We’ll discuss possible exams subjects this Saturday, 02.02.2018, in the 10:30 – 12:30 interval. We’ll meet in JA001, as usual.
Exam samples from previous years:
Every course is available here.
A link to several examples (+solutions) of recurrences solved using the Master Theorem.
A quiz from MIT on the subject of asymptotic complexities.
If you have any questions, please don’t hesitate to post a comment.
We would appreciate if you can take a minute to leave some feedback.
Algorithm Design and Complexity - FILS 
For exam sample v2, at exercise B2 c), if the graph is directed and there are 2 costs between 2 vertices, when converting to a undirected graph which cost do we choose for that edge?
You could make both edges undirected and associate the original costs to each one. (an undirected edge with cost 1 and an undirected edge with cost 4).
In real problems it sometimes does happen to have more than one edge between two nodes. In practice, you shouldn’t have to make any changes to the implementation of Kruskal to make it work.
For the exam what is important is just to be able to apply the algorithm correctly on an undirected graph. (no pseudo-code is needed for B2)