Athasit Surarerks

2110 681 Computer Algorithm

Credits Department Faculty Semester Instructor(s) Formation Hours/Week

3(3-0-9) Computer Engineering Engineering First Athasit Surarerks, Dr. en Inf. Office 19-04, tel:0 2218 6989, athasit@cp.eng.chula.ac.th ELITE, 20^th floor ENG4, tel 0 2218 6376 Master of Engineering 3

Course Description

Analysis and design of efficient algorithms; divide and conquer, recursion, dynamic programming and greedy algorithm; selection of appropriate data abstraction; analysis and correctness of algorithms; algebraic algorithms; combination problems; proving techniques for complexity analysis.

Evaluation
Mid-Term Examinmation	50 %
Final Examination	50 %

Text-book
T. Cormen et al	Introduction Algorithms (2nd edition)

Chapter	Topics
1 2 3	Introduction Analysis of Algorithms: Introduction Amortized Analysis - Lecture Example I - Solution	Analysis
	Mid-Term Examination	50 %
4 5 6 7 8 9	Divide and Conquer Dynamic Programming Greedy Algorithm Searching Randomized Algorithm NP-Complete coming soon	Design Proving Techniques for Complexity Analysis
	Final Examination	50 %