Discrete Structures

Catalog description

Prerequisites: MATH 1800 or MATH 1100 , and CMP SCI 1250 or equivalent. This course introduces fundamental concepts and important data structures in Discrete Mathematics and serves as an important foundation for subsequent courses in Computer Science. It provides a formal system on which mathematical reasoning is based, and various problem-solving strategies with emphasis on the algorithmic approach (both iterative and recursive). Topics include logic, sets, functions and relations; methods of proof, including mathematical induction; elements of number theory; order of growth and basic analysis of algorithms efficiency; recurrence relations; basic counting methods; graphs and trees. This course does not apply towards the elective requirements for any of the majors, minors or related areas in mathematics and statistics.