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

  1. introduction
  2. asymtotic analysis
  3. analysis of algorithms
  4. divide and conquer
  5. dynamic programming 1
  6. dynamic programming 2
  7. greedy
  8. midterm exam
  9. NP complete 1
  10. NP complete 2
  11. state space search
  12. backtracking, branch and bound
  13. probabilistic algorithms
  14. linear programming
  15. summary
  16. 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%