my lecture of year 2004
my lecture of year 2002
my lecture note of year 2001
my lecture note of year 2000 ( only
part
2)
Lecture 1 An overview of
algorithmics
Lecture 2 Analysis of algorithms
Lecture 3
Dynamic programming
Lecture 4 Divide and Conquer
Lecture 5-8
Lecture 9-10 NP-complete
Lecture 11 State space search
Lecture 12 Backtracking,
branch
and bound (ppt year 2000)
Lecture 13 Probabilistic
algorithms
(see lecture year 2001)
Lecture 14
Lecture 15
End of class