|
|
Lecture plan
| Week |
Date |
Text |
Subject |
Weekplan |
| 1 |
27/8 |
CLR Chapter 2 and Sec. 23.1 |
Introduction, O-notation, Graphs |
|
| 2 |
3/9 |
CLR Chapter 2 og 23 |
Graphs, depth- and breadth-first search |
Week 2 |
| 3 |
10/9 |
CLR Chapter 25 |
Single-source shortest path |
Week 3 |
| 4 |
17/9 |
CLR Chapter 22 and 24 |
Minimum Spanning Tree |
Week 4 |
| 5 |
24/9 |
CLR Chapter 26 |
All pairs shortest path |
Week 5 |
| 6 |
1/10 |
CLR section 12.1 to 12.3 and sections 16.1 and 16.2 |
Hashing and dynamic programming |
Week 6 |
| 7 |
8/10 |
BDD note section 1, 2 and 3 |
BDD introduction |
Week 7 |
| |
15/10 |
|
Fall vacation |
|
| 8 |
22/10 |
BDD note section 4, 5, and 6 |
BDD algorithms |
Week 8 |
| 9 |
29/10 |
BDD note section 7 |
BDD applications |
Week 9 |
| 10 |
5/11 |
CLR kapitel 36.1-2 |
NP completeness (intro) |
Week 10 |
| 11 |
12/11 |
CLR kapitel 36.3-4 |
NP completeness |
Week 11 |
| 12 |
19/11 |
CLR kapitel 36.5 |
NP-complete problems |
Week 12 |
CLR stands for "Cormen, Leiserson, and Rivest: Introduction
to Algorithms".
To read the week-plans you need the Adobe Acrobat Reader which is
available for free from here: 
|
|
