Description
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.
Prerequisites
- Prerequisite(s): COMP 1006 and at least one of MATH 1007 , MATH 1107 , or STAT 2507 .
Conditions and arrangements
- 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.
- Prerequisite(s): COMP 1006 and at least one of MATH 1007 , MATH 1107 , or STAT 2507 .
- Lectures three hours a week.
Reference text in its original language
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.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/