Discrete Mathematics
Download as PDF
Course Information
Course Description
Introduction to the mathematical analysis of finite collections and to the mathematical foundations of sequential machines, computer system design, data structures and algorithms. Topics include, but are not restricted to sets, counting, recursion, graph theory, trees, networks, Boolean algebras, automata, and formal grammars and languages. This course is a beginning course in the mathematics of computer science. NOTE: Specific graphing calculator is required for this course. Contact the EMPS division office for details.
Minimum Credit Hours
3
Maximum Credit Hours
3
Lecture - Lab Hours
(3-0)
PCS Code
1.1
IAI Code
CS 915
Requirements
Prerequisite: MTH 122 (C or better) or appropriate score on CLC Math Placement Test, Math ACT, or Math SAT.