Course Syllabus

Course Information：

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2025	345156	Design and Analysis of Computer Algorithms	1	3.0	3	★	CHUAN-MING LIU	GCSIE IEECSG MSIS	70	0	Course jointly offered with Computer Science

Course Plan：

Instructor	CHUAN-MING LIU　Office Hours
Email	cmliu@ntut.edu.tw
Last Updated	2024-12-17 09:09:46
Course Objective	The course gives a broad introduction about the design and analysis of computer algorithms. General topics to be covered include: growth of functions, recurrences, sorting and order statistics, fundamental and advanced data structures, dynamic programming, greedy algorithms, graph algorithms, and NP-completeness.
Course Schedule	1. Introduction (0.5 week) 2. Asymptotic analysis (1.5 weeks) 3. Recurrence Relations (1 week) 4. Advanced Data Structures (2 weeks) 5. Average and worst analysis (1 weeks) 6. Lower Bounds (1 week) 7. Dynamic Programming (2 weeks) 8. Graph algorithms (1.5 weeks) 9. Search and Traversal Techniques (1.5 week) 10. NP-Completeness (2 weeks) 11. Approximation Algorithms (1 week) 12. New Trends in Algorithms (2 weeks) (* 1 week for exams, including midterm and final)
Evaluation and grading policy	Assignments (40%): 7-9 homework sets. Midterm (25%) Final exam (35%)
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes Textbook: Introduction to Algorithms, 3nd edition. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. MIT Press Edition, 2009. References: 1. Computer Algorithms /C++, 2nd Edition. E. Horowitz, S. Sahni, and S. Rajasekaran, W.H. Freeman and Company, 1998. 2. Computer Algorithms, 3rd edition. S. Baase and A. V. Gelder. Addison-Wesley, 2000. 3. Algorithms in C++, 3rd. R. Sedgewick. Addison-Wesley, 1998. 4. Algorithms, R. Johnsonbaugh and M. Schaefer, Pearson Prentice Hall, 2004. 5. Algorithm Design, Jon Kleinberg and ?va Tardos, Pearson/Addison-Wesley, 2006. 6. Algorithms, Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw-Hill, 2008. ISBN:978-007-125975-0.
The access to curricular consultation	Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)
The course corresponds to the SDGs	無（None）
Note	For the distance learning, the on-line teaching will be given during the official class hours using Microsoft Teams. In addition, all the related material and homework sets will be released and collected with the NTUT i-school plus (https://istudy.ntut.edu.tw/learn/index.php) platform.