Discrete Mathematics ((4 Credits))

Catalog description

This course explores the precise foundational mathematical concepts that underlie much of computer science and advanced studies in mathematics. Topics include formal symbolic logic, an introduction to deductive proof, set theory, relations, functions, partial orders, induction, recursion, principles of counting, algorithms, complexity, and introductory concepts in graph theory. Prerequisites (must complete before registering): Excellent algebraic skills and working knowledge of mathematical notation and terminology. Highly Recommended (not required): At least two semesters of undergraduate mathematics, with one of these being at a minimum Pre-Calculus or higher. Note: Students who wish to concentrate in mathematics, applied mathematics, or related fields such as computer science, information systems, or information technology are most likely to take this course. This course contains elements which rely on vision to complete. If you have a visual impairment and are considering registering for this course, it is recommended that you reach out to Accessibility Resources and Services ([email protected]) in advance of registration to determine if this course is appropriate and what alternatives may be available. This course was previously SMT-273104.