2110427 Design and Analysis of Algorithm 2002
Prabhas Chongstitvatana
office Eng. Building 4, Floor 18 Room 13,
tel: 02-2186982, email
me
What's new
28 Aug 2002 Divide and Conquer
State-space search including discussion
16 Sept 2002 Genetic Algorithms
19 Sept 2002 Linear Programming
Other lecture of this class
Somchai Prasitjutrakul
2110427 course pages
my lecture note of year 2001
my lecture note of year 2000 ( only part
2)
Scope of this year lecture:
One half is devoted to "easy" (P) problem, another half is "hard" (NP)
problem. We include "Linear Programming" as a new addition because
of its important for the future class on "Optimization" which is an important
subject in Engineering.
Lecture 1 An overview of algorithmics
Lecture 2 Analysis of algorithms
Lecture 3
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 Genetic Algorithms
Lecture 15 Linear programming
End of class