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 341285 Computer Algorithms 1 3.0 3 ★ RONG-SHUE HSIAO 4EECS2 17 2 選修。

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2025	341285	Computer Algorithms	1	3.0	3	★	RONG-SHUE HSIAO	4EECS2	17	2	選修。

Course Plan：

Instructor RONG-SHUE HSIAO

Email rshsiao@ntut.edu.tw

Last Updated 2024-12-16 17:57:56

Course Objective 介紹計算機演算法的設計與分析,內容包含了: 函數成長, 遞迴關係, 排序及序列統計, 基礎與進階資料結構, 動態規劃, 貪婪演算法, 搜尋, 圖形與幾何演算法, 字串比對, NP-completeness, 近似演算法, 及平行與分散式演算法. This 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, searching, graph and geometry algorithms, string matching, NP-completeness, approximation algorithms, parallel and distributed algorithms.

Course Schedule Calendar: 1. Mathematical Foundations: Introduction 2. Analyzing & Designing Algorithms 3. Growth of Functions 4. Recurrences 5. Heapsort 6. Quicksort 7. Sorting in Linear Time 8. Medians 9. Order Statistics 10. No Class (統測) 11. Mid-term Exam 12. Greedy Algorithms 13. Dynamic Programming 14. Elementary Graph Algorithms & Minimum Spanning Trees 15. Shortest Paths Algorithms 16. Term Project 編寫與總複習 17. Term Project 編寫與總複習 18. Final Exam

Evaluation and grading policy Grading: 30% Assignments & Term Project 30% Mid-term Exam (take home 40%, in class 60%) 40% Final Exam (take home 40%, in class 60%)

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:Yes
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Ed., The MIT Press, 2001. (開發) 2. Michael T. Goodrich, Roberto Tamassia, and David M. Mount, Data Structures and Algorithms in C++, Second Edition, John Wiley & Sons, Inc, 2011. (ISBN-13 978-0-470-38327-8)

The access to curricular consultation rshsiao@ntut.edu.tw

The course corresponds to the SDGs SDG4：優質教育（Quality Education）
SDG5：性別平等（Gender Equality）
SDG8：尊嚴就業與經濟發展（Decent Work and Economic Growth）
SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure）
SDG12：負責任的消費與生產（Responsible Consumption and Production）
SDG17：夥伴關係（Partnerships for the Goals）

Note
第17、18週各組討論與製作Term project.
6月18日前各組以email繳交Term project。

Instructor	RONG-SHUE HSIAO
Email	rshsiao@ntut.edu.tw
Last Updated	2024-12-16 17:57:56
Course Objective	介紹計算機演算法的設計與分析,內容包含了: 函數成長, 遞迴關係, 排序及序列統計, 基礎與進階資料結構, 動態規劃, 貪婪演算法, 搜尋, 圖形與幾何演算法, 字串比對, NP-completeness, 近似演算法, 及平行與分散式演算法. This 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, searching, graph and geometry algorithms, string matching, NP-completeness, approximation algorithms, parallel and distributed algorithms.
Course Schedule	Calendar: 1. Mathematical Foundations: Introduction 2. Analyzing & Designing Algorithms 3. Growth of Functions 4. Recurrences 5. Heapsort 6. Quicksort 7. Sorting in Linear Time 8. Medians 9. Order Statistics 10. No Class (統測) 11. Mid-term Exam 12. Greedy Algorithms 13. Dynamic Programming 14. Elementary Graph Algorithms & Minimum Spanning Trees 15. Shortest Paths Algorithms 16. Term Project 編寫與總複習 17. Term Project 編寫與總複習 18. Final Exam
Evaluation and grading policy	Grading: 30% Assignments & Term Project 30% Mid-term Exam (take home 40%, in class 60%) 40% Final Exam (take home 40%, in class 60%)
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes 1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Ed., The MIT Press, 2001. (開發) 2. Michael T. Goodrich, Roberto Tamassia, and David M. Mount, Data Structures and Algorithms in C++, Second Edition, John Wiley & Sons, Inc, 2011. (ISBN-13 978-0-470-38327-8)
The access to curricular consultation	rshsiao@ntut.edu.tw
The course corresponds to the SDGs	SDG4：優質教育（Quality Education） SDG5：性別平等（Gender Equality） SDG8：尊嚴就業與經濟發展（Decent Work and Economic Growth） SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure） SDG12：負責任的消費與生產（Responsible Consumption and Production） SDG17：夥伴關係（Partnerships for the Goals）
Note	第17、18週各組討論與製作Term project. 6月18日前各組以email繳交Term project。