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	345611	Design and Analysis of Computer Algorithms	1	3.0	3	★	Meng-Shiuan Pan	ECE IEECSG SSRT MSAI	35	0	Course jointly offered with Electronic Engineering Dept.

Course Plan：

Instructor	Meng-Shiuan Pan　Office Hours
Email	mspan@ntut.edu.tw
Last Updated	2024-12-17 13:52:32
Course Objective	This course will introduce common algorithms and analysis methods. The details include complexity analysis, set, priority queue, trees, sorting, searching, graph, NP complete, and so on.
Course Schedule	week 1: Complexity week 2: Data structures week 3: Divide and Conquer week 4: Divide and Conquer week 5: Divide and Conquer week 6: Greedy algorithm week 7: Greedy algorithm week 8: Dynamic programming week 9: Dynamic programming week 10: Dynamic programming week 11: Searching week 12: Searching week 13: Backtracking week 14: Backtracking week 15: Branch and bound week 16: Branch and bound week 17: NP week 18: NP
Evaluation and grading policy	3 exams: 75% homework and others: 25%
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes Computer Algorithms (2/E) by Horowitz, Sahni, & Rajasekaran
The access to curricular consultation	Appointment through e-mail.
The course corresponds to the SDGs	SDG4：優質教育（Quality Education）
Note