此參考說明所註明的目錄。請向該機構確認當前課程供給與適用於你入學的條件。
課程說明
演算法 電腦演算法的設計與分析。主題包括漸近符號、遞迴方程的求解、秩統計、一般演算法設計技術如分治、貪婪演算法、動態規劃、回溯與分支限界。圖論與字串演算法。NP-完備性與複雜性理論導論。授課，每週 3 小時。先修科目：COSC 2P03（最低 60%）。注意：本課程可能以多種授課模式提供。授課方式將登載於學期課務表。
先修條件
- 先修科目：COSC 2P03（最低 60%）。
條件與方式
- 先修科目：COSC 2P03（最低 60%）。
- 注意：此課程可能以多種授課方式開設。授課方式將在適用學期的學術時刻表中列出。
原文參考文本
Algorithms Design and analysis of computer algorithms. Topics include asymptotic notations, solving recurrences, order statistics, general algorithm design techniques such as divide-and-conquer, greedy algorithms, dynamic programming, backtracking and branch-and-bound. Graph and string algorithms. Introduction to NP-Completeness and complexity theory. Lectures, 3 hours per week. Prerequisite(s): COSC 2P03 (minimum 60 percent). Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.
- Prerequisite(s): COSC 2P03 (minimum 60 percent).
- Note: this course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.
來源與參考
保留日期與來源以協助你核實資料。為便於閱讀提供譯文；官方來源為條件與要求的參照。
來源參考 : https://brocku.ca/webcal/2024/undergrad/cosc.html