This course introduces students to the fundamental concepts of discrete mathematics. The course provides a foundation for the development of many computer related concepts and more advanced mathematical concepts found in electrical engineering or computer science courses. Important applications in the computer science and engineering disciplines will be presented. Topics include: fundamentals (basic tools for discrete math); logic; methods of proof; graphs and sets; functions; relations and equivalences; recursive relations; polynomial sequences; induction; combinatorics; counting; and probability. (Prerequisites: MATH110, MATH111, or MATH225)

View the course schedule to find out details about each course including prerequisites, course objectives, course materials, a snapshot of the syllabi, and session dates.