Schedule

Week	Date	Activity	Topic	Reading instructions
3	16/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.
	25/1	Exercise 2	Divide and Conquer Algorithms
5	29/1	Lecture 5	Dynamic Programming	Ch 6
	31/1	Lecture 6	Dynamic Programming cont.	Ch 6
	1/2	Exercise 3	Dynamic Programming
6	6/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
	8/2	Exercise 4	Dynamic Programming cont.
	8/2	Mas 1	Mas 1 published
	9/2	Lab 1	Reporting of theory problems. Help session.
7	12/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	19/2	Lecture 11	Uncomputability.	Lecture notes. Extra material on Uncomputability. Can be found on Kurswebben.
	19/2	Mas 1	Mas 1 handed in.
	21/2	Lecture 12	Turing Machines. Computability.	Lecture notes. Extra material on Turing Machines. Can be found on Kurswebben. (You must login.)
	22/2	Exercise 6	NP-problems.
13	26/3	Lecture 13	Approximation Algorithms	Ch 11
	27/3	Exercise 7	NP-problems. Uncomputability.
	28/3	Lab 2	Reporting of theory problems. Help session.
14	6/4	Mas2	Mas 2 published
15	9/4	Lecture 14	Approximation Algorithms cont.	CH 13.1-13.5
	12/4	Exercise 8	Approximation Algorithms.
16	16/4	Lecture 15	PSPACE-problems.	Ch 9
	18/4	Exercise 9	Repetition.
	19/4	Lab 2	Lab reporting.
	20/4	Mas 2	Mas 2 handed in.
22	31/5		Exam