MATH201 — Discrete Mathematics

MATH 201 - Discrete Mathematics MATH 201 - Discrete Mathematics 4 Hour(s) Students will master proof techniques including direct proof, proof by contradiction and mathematical induction; apply set theory, functions and relations; solve counting and combinatorics problems; work with recurrence relations and modular arithmetic and analyze graphs, trees and network algorithms. Emphasis is placed on rigorous mathematical argument and algorithmic problem-solving relevant to computer science.

Prerequisites: MATH123

Part of

• Secondary Education, AS
• Computer Information Systems, AS
• Computer Science, AS
• Cybersecurity, AS
• Mathematics, AS
• Pre-Engineering, AS

Source ↗

← back to gardencity catalog