Discrete Mathematics for Computing

Catalog description

Discrete mathematics topics useful in computer-aided problem solving. Topics will include Boolean algebra and computer logic, graphs and trees with algorithms, and analysis of algorithm complexity. Prerequisites: CM 111 and one of the following: A “C” or better in MA 116 or MA 123 , or an acceptable (as determined by the Mathematics Department) ACT mathematics score or an acceptable SAT quantitative score, or equivalent knowledge as determined by the Mathematics Department.