Course Syllabus

Course Information：

Year-Semester Course Number Course Name Phase Credits Hours Required/Elective Instructor Class Student NO. Withdraw Note

Spring Semester
Year 2021 283638 Computer Algorithms 1 3.0 3 ★ RONG-SHUE HSIAO 4EECS2 40 0 資工三和電資二合開,科研大教室

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2021	283638	Computer Algorithms	1	3.0	3	★	RONG-SHUE HSIAO	4EECS2	40	0	資工三和電資二合開,科研大教室

Course Plan：

Instructor RONG-SHUE HSIAO

Email rshsiao@ntut.edu.tw

Last Updated 2020-12-12 17:38:31

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 and Order Statistics 9. Mid-term Exam 10. Greedy Algorithms 11. Dynamic Programming_1 12. Dynamic Programming_2 13. Other Optimization Algorithms 14. Elementary Graph Algorithms 15. Minimum Spanning Trees 16. Shortest Paths Algorithms 17. NP-Completeness 18. Final Exam

Evaluation and grading policy Grading: 10% Attendance 20% Assignments 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. (開發)

The access to curricular consultation

The course corresponds to the SDGs

Note
　

Instructor	RONG-SHUE HSIAO
Email	rshsiao@ntut.edu.tw
Last Updated	2020-12-12 17:38:31
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 and Order Statistics 9. Mid-term Exam 10. Greedy Algorithms 11. Dynamic Programming_1 12. Dynamic Programming_2 13. Other Optimization Algorithms 14. Elementary Graph Algorithms 15. Minimum Spanning Trees 16. Shortest Paths Algorithms 17. NP-Completeness 18. Final Exam
Evaluation and grading policy	Grading: 10% Attendance 20% Assignments 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. (開發)
The access to curricular consultation
The course corresponds to the SDGs
Note