MAT 220 - Discrete Mathematics

3 Credit(s)

This course introduces fundamental concepts and data structures to serve as a 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). The course provides the mathematical foundation, level of abstract thinking, and knowledge of discrete mathematics topics essential to computer science including: logic, sets, functions and relations; methods of proof, including mathematical induction; elements of number theory; order of growth and basic analysis of algorithm efficiency; recurrence relations; basic counting methods; graphs and trees.

Prereqs: MAT 180 & CPT 135
Course Type: Lecture
Tuition Tier: Base
Delivery Method:
In-Person, Remote, Hybrid, Flex
Course Learning Outcomes:
CLO 1) Students will perform operations involving logic, sets, and functions.
CLO 2) Students will construct proofs using a variety of techniques, including induction.
CLO 3) Students will solve problems involving algorithms.
CLO 4) Students will apply counting principles to solve problems.
CLO 5) Students will model relationships using graphs and trees.