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. Only one of MATH 1805/COMP 1805 or MATH 2800/CMPS 2800 may count for credit in a B.Math. program. Also listed as CMPS 2800. Prerequisite(s): COMP 1006 and at least one of MATH 1007, MATH 1107, or STAT 2507.Lectures three hours a week.

MATH 2800 [0.5 credit] Discrete Mathematics and Algorithms

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. Only one of MATH 1805/COMP 1805 or MATH 2800/CMPS 2800 may count for credit in a B.Math. program. Also listed as CMPS 2800. Prerequisite(s): COMP 1006 and at least one of MATH 1007, MATH 1107, or STAT 2507.Lectures three hours a week.





There are no comments for this course.