Course Description
This course will review and build upon the major discrete math concepts introduced in MATH 2225 and examine additional mathematical topics needed for the study of computer and information science. A principal goal is the development of the ability to think and write clearly and mathematically about computer science problems and their solutions. Discrete math topics covered in the course include graphs, trees, Boolean algebra, relations, and introductory theory of computation. Applications studied may include the verification of algorithms, the formal specification of software systems, semantics of programming languages, automata, and circuit design.
Course Attributes
Q1- Quant Reasoning Intensive
Units
4
