Instructor: Heather Makarewicz
Discrete Math is a field with many applications including computer science, cryptography, mapping, planning, and scheduling. The purpose of this course is to re-introduce students to the major concepts involved in discrete math and to discuss its relevant applications. Topics include sets, number systems, the nature of proof, formal logic, functions and relations, combinatorics, recurrence relations, trees, and Boolean algebra. The target audience is future and current math practitioners. Request the syllabus.
A $30 early enrollment discount is applied at checkout up to 30 days prior to course commencement