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 340679 Computer Algorithms 1 3.0 3 ★ LIN,Jyun-Ao 4CSIE3 62 3 　

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2025	340679	Computer Algorithms	1	3.0	3	★	LIN,Jyun-Ao	4CSIE3	62	3

Course Plan：

Instructor LIN,Jyun-Ao　Office Hours

Email jalin@ntut.edu.tw

Last Updated 2025-11-02 13:56:36

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 Week 01: Introduction Week 02: Array Week 03: Linked list Week 04: Hash table Week 05: Memorization, dynamic programming Week 06: Disjoint classes Week 07: Backtracking Week 08: Tree (1/2) Week 09: Tree (2/2) and immutable data structure Week 10: Mid-term Week 11: Priority queues Week 12: Data compression Week 13: Sorting (1/2) Week 14: Sorting (2/2) Week 15: Graph (1/2) Week 16: Graph (2/2) Week 17: Final Week 18: Final comments

Evaluation and grading policy Assignment 50% Midterm 20% Final 30%

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:No
Useful references: 1. Algorithm, 4th ed, https://algs4.cs.princeton.edu/home/ 2. Introduction to Programming in Java, https://introcs.cs.princeton.edu/java/home/

The access to curricular consultation jalin[at]ntut.edu.tw

The course corresponds to the SDGs SDG4：優質教育（Quality Education）
SDG7：可負擔的潔淨能源（Affordable and Clean Energy）

Does the course incorporate AI ● 鼓勵學生使用生成式AI工具（Encourage students to use generative AI tools）

Note
course website: https://carquois42.github.io/algorithm.html

Instructor	LIN,Jyun-Ao　Office Hours
Email	jalin@ntut.edu.tw
Last Updated	2025-11-02 13:56:36
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	Week 01: Introduction Week 02: Array Week 03: Linked list Week 04: Hash table Week 05: Memorization, dynamic programming Week 06: Disjoint classes Week 07: Backtracking Week 08: Tree (1/2) Week 09: Tree (2/2) and immutable data structure Week 10: Mid-term Week 11: Priority queues Week 12: Data compression Week 13: Sorting (1/2) Week 14: Sorting (2/2) Week 15: Graph (1/2) Week 16: Graph (2/2) Week 17: Final Week 18: Final comments
Evaluation and grading policy	Assignment 50% Midterm 20% Final 30%
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:No Useful references: 1. Algorithm, 4th ed, https://algs4.cs.princeton.edu/home/ 2. Introduction to Programming in Java, https://introcs.cs.princeton.edu/java/home/
The access to curricular consultation	jalin[at]ntut.edu.tw
The course corresponds to the SDGs	SDG4：優質教育（Quality Education） SDG7：可負擔的潔淨能源（Affordable and Clean Energy）
Does the course incorporate AI	● 鼓勵學生使用生成式AI工具（Encourage students to use generative AI tools）
Note	course website: https://carquois42.github.io/algorithm.html