描述
在计算科学背景下的离散数学与算法导论。基础数论与计数方法，字符串、树与序列的算法。对 DNA 与蛋白质测序问题的应用。算法的分析与复杂性。
先修课程
- 先修课：COMP 1006 及下列之一：MATH 1007、MATH 1107、或 STAT 2507。
条件与方式
- 亦列为 CMPS 2800。
- 在 B.Math. 项目中，仅允许下列之一计学分：MATH 1805（不再开设）或 COMP 1805，或 MATH 2800/CMPS 2800。
- 先修课：COMP 1006 及下列之一：MATH 1007、MATH 1107、或 STAT 2507。
- 每周讲课三小时。
原文参考文本
An introduction to discrete mathematics and algorithms in the context of the computational sciences. Basic number theory and counting methods, algorithms for strings, trees and sequences. Applications to DNA and protein sequencing problems. Analysis and complexity of algorithms.
- Prerequisite(s): COMP 1006 and at least one of MATH 1007 , MATH 1107 , or STAT 2507 .
- Also listed as CMPS 2800.
- Precludes additional credit for Precludes additional credit for Only one of (MATH 1805 (no longer offered) or COMP 1805 ) or MATH 2800 /CMPS 2800 may count for credit in a B.Math. program.
- Lectures three hours a week.
来源与参考
为帮助您核实信息，保留了日期和来源。为便于阅读提供了翻译；以官方来源为准，查看条件和要求。
来源参考 : https://calendar.carleton.ca/undergrad/courses/MATH/