COMP 3010 - Discrete Mathematics (4)

This course presents discrete mathematical structures needed for computer science. Topics include: logic and methods of proof, structures of sets and functions, fundamentals of algorithms, relations, permutations and combinations, discrete probability, graphs and trees and their applications, introduction to mathematical structures such as modular arithmetic, groups, ring, and field. Prerequisite(s): MATH 1910 or COMP 2140 or equivalent.