该参考描述所示目录。请向院校确认当前的招生项目及适用于您入学年的条件。
描述
算法 计算机算法的设计与分析。主题包括渐近符号、递推式求解、秩统计、一般算法设计技术如分治法、贪心算法、动态规划、回溯与分支限界法。图算法与字符串算法。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