教學大綱與進度
課程基本資料:
學年期
課號
課程名稱
階段
學分
時數
修
教師
班級
人
撤
備註
110-2
302147
演算法分析與設計
1
3.0
3
★
潘孟鉉
職電子所
2
1
◎電子所日職與電資外生所合開,英語授課
教學大綱與進度:
教師姓名
潘孟鉉
Email
mspan@ntut.edu.tw
最後更新時間
2022-02-21 09:04:07
課程大綱
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.
課程進度
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
評量方式與標準
4 exams: 80% homework and others: 20%
使用教材、參考書目或其他
【遵守智慧財產權觀念,請使用正版教科書,不得使用非法影印教科書】
使用外文原文書:是
Computer Algorithms (2/E) by Horowitz, Sahni, & Rajasekaran
課程諮詢管道
課程對應SDGs指標
備註
If our school is closed because of Covid19, this course will be continued through Google meet.