Discrete Mathematics (MATH 330)

This course will cover the topics of symbolic logic, sequences, graph theory and trees, recursive relations, linear programming, and number theory topics such as divisibility, Euclidean algorithm and prime numbers. Prerequisite: MATH151 - Calculus I and COMS103 - Intro to Programming I, or consent of instructor.

MATH330 is a 3 credit course.