Discrete Mathematics
Download as PDF
Overview
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.
Career
ACAD
Credits
Value
0
Max
3
Min
3
Course Count
1
Number Of Credits
3
Number Of Repeats
1
Repeatable
No
Generate Attendance
No
Auto Create
No
Code
LEC
Instructor Contact Hours
0
Default Section Size
25
Final Exam Type
Yes
Include in Dynamic Date Calc
Yes
LMS File Type
BKB
Name
Lecture
OEE Workload Hours
0
Optional Component
No
Workload Hours
3
Requisites
Free Form Requisites
Prerequisite: MTH 122 (C or better) or appropriate score on CLC Math Placement Test, Math ACT, or Math SAT.