Undergraduate Catalog

MAT-2700 Discrete Mathematics

Discrete Mathematics is designed to meet the needs not only of students majoring in computer science but of a wider audience, especially students in mathematics and science. The course provides tools for formal reasoning. Topics include counting rules, propositional and first-order logic, set theory, functions (with an emphasis on recursive functions), partial order and equivalence relations, Boolean algebra, and switching circuits. Graphs and trees are also introduced. With an emphasis on communication skills, students are required to interpret, describe, discuss, and justify conclusions based on logical reasoning. While the particular focus of the course is on reasoning related to computer programs, no knowledge of programming is required.

Advisory: It is advisable to have knowledge in a course equivalent to MAT-1210: College Algebra with a grade of C or better to succeed in this course. Students are responsible for making sure that they have the necessary knowledge.

Credits

3

Prerequisite

MAT-1210

Delivery Methods

Guided Study, Online, Self-Directed

Example Syllabus Link

Preview the Online Syllabus

Semester Offered

Terms Available