Syllabus
2110427 Analysis and design of algorithm 2002
lecturer
Somchai Prasitjutrakul
office Eng Build 4 Floor 18 room 12
tel 02-2186981 email
Prabhas Chongstitvatana
office Eng Build 4 Floor 18 room 13
tel 02-2186982 email
Weekly schedule
-
introduction
-
asymtotic analysis
-
analysis of algorithms
-
divide and conquer
-
dynamic programming 1
-
dynamic programming 2
-
greedy
-
midterm exam
-
NP complete 1
-
NP complete 2
-
state space search
-
backtracking, branch and bound
-
probabilistic algorithms
-
linear programming
-
summary
-
final exam
References
main text :
T. Cormen, C. Leiserson, R. Rivest, Introduction to algorithms, MIT
press.
(2 edition include C. Stein 2001)
other text:
Somchai Prasitjutrakul, Analysis and design of algorithms, NASTDA,
2544. (in Thai)
G. Brassard and P. Bradley, Fundamentals of algorithms, Prentice hall,
1996.
G. Rawlins, Compared to what? an introduction to the analysis
of algorithms, Computer science press, 1992.
Assessment
midter exam 40%
final exam 40%
quiz and homework 20%