Schedule

This is a preliminary form. There could be small changes during the course.

Week Date Activity Topic Reading instructions
3 15/1 Lecture 1 Introduction. Graph Algorithms Ch. 1-3
17/1 Lecture 2 Greedy Algorithms Ch. 4 (Except 4.4)
18/1 Exercise 1 Algorithm Analysis
4 22/1 Lecture 3 Flow Algorithms. More about graph algorithms. Ch 7.1-7.3, 7.5, 4.4, 6.8-6.10
24/1 Lecture 4 Divide and Conquer Algorithms. Ch 5.
25/1 Exercise 2 Divide and Conquer Algorithms
5 29/1 Lecture 5 Dynamic Programming Ch 6
30/1 Lecture 6 Dynamic Programming cont. Ch 6
30/1 Exercise 3 Dynamic Programming
31/1 Lab 1 Help session.
6 4/2 Lecture 7 Introduction to Linear Programming Lecture notes. Extra material on Linear Programming. Can be found on Kurswebben.
7/2 Lecture 8 Probabilistic Algorithms and other algorithms Lecture notes
7/2 Exercise 4 Dynamic Programming cont.
7/2 Mas 1 Mas 1 published
8/2 Lab 1 Reporting of theory problems. Help session.
7 11/2 Lecture 9 Complexity. NP-problems. Ch 8
13/2 Lecture 10 NP-problems cont. Ch 8
14/2 Exercise 5 Flow Algorithms and Linear Programming.
15/2 Lab 1 Lab reporting
8 18/2 Lecture 11 Uncomputability. Lecture notes. Extra material on Uncomputability. Can be found on Kurswebben.
20/2 Lecture 12 Turing Machines. Computability. Lecture notes. Extra material on Turing Machines. Can be found on Kurswebben. (You must login.)
21/2 Exercise 6 NP-problems.
21/2 Mas 1 Mas 1 handed in.
14 1/4 Lecture 13 Approximation Algorithms Ch 11
2/4 Exercise 7 NP-problems. Uncomputability.
4/4 Lab 2 Help session.

15 9/4 Lecture 14 Approximation Algorithms cont. CH 13.1-13.5
10/4 Exercise 8 Approximation Algorithms.
11/4 Mas2 Mas 2 published
12/4 Lab 2 Reporting of theory problems. Help session.
17 23/4 Lecture 15 PSPACE-problems. Ch 9
24/4 Exercise 9 Repetition.
25/4 Mas 2 Mas 2 handed in.
26/4 Lab 2 Lab reporting.

22 31/5 Exam

Week	Date	Activity	Topic	Reading instructions
3	15/1	Lecture 1	Introduction. Graph Algorithms	Ch. 1-3
	17/1	Lecture 2	Greedy Algorithms	Ch. 4 (Except 4.4)
	18/1	Exercise 1	Algorithm Analysis
4	22/1	Lecture 3	Flow Algorithms. More about graph algorithms.	Ch 7.1-7.3, 7.5, 4.4, 6.8-6.10
	24/1	Lecture 4	Divide and Conquer Algorithms.	Ch 5.
	25/1	Exercise 2	Divide and Conquer Algorithms
5	29/1	Lecture 5	Dynamic Programming	Ch 6
	30/1	Lecture 6	Dynamic Programming cont.	Ch 6
	30/1	Exercise 3	Dynamic Programming
	31/1	Lab 1	Help session.
6	4/2	Lecture 7	Introduction to Linear Programming	Lecture notes. Extra material on Linear Programming. Can be found on Kurswebben.
	7/2	Lecture 8	Probabilistic Algorithms and other algorithms	Lecture notes
	7/2	Exercise 4	Dynamic Programming cont.
	7/2	Mas 1	Mas 1 published
	8/2	Lab 1	Reporting of theory problems. Help session.
7	11/2	Lecture 9	Complexity. NP-problems.	Ch 8
	13/2	Lecture 10	NP-problems cont.	Ch 8
	14/2	Exercise 5	Flow Algorithms and Linear Programming.
	15/2	Lab 1	Lab reporting
8	18/2	Lecture 11	Uncomputability.	Lecture notes. Extra material on Uncomputability. Can be found on Kurswebben.
	20/2	Lecture 12	Turing Machines. Computability.	Lecture notes. Extra material on Turing Machines. Can be found on Kurswebben. (You must login.)
	21/2	Exercise 6	NP-problems.
	21/2	Mas 1	Mas 1 handed in.
14	1/4	Lecture 13	Approximation Algorithms	Ch 11
	2/4	Exercise 7	NP-problems. Uncomputability.
	4/4	Lab 2	Help session.
15	9/4	Lecture 14	Approximation Algorithms cont.	CH 13.1-13.5
	10/4	Exercise 8	Approximation Algorithms.
	11/4	Mas2	Mas 2 published
	12/4	Lab 2	Reporting of theory problems. Help session.
17	23/4	Lecture 15	PSPACE-problems.	Ch 9
	24/4	Exercise 9	Repetition.
	25/4	Mas 2	Mas 2 handed in.
	26/4	Lab 2	Lab reporting.
22	31/5		Exam