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