MATH2611 — Discrete Mathematics for Computer Science
MATH 2611 - Discrete Mathematics for Computer Science MATH 2611 - Discrete Mathematics for Computer Science A course designed to prepare computer science majors for a background in mathematical abstraction, notation, and critical thinking. Topics include logic, relations, functions, basic set theory, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, number theory, and graph theory. It is intended for Computer Science majors. The use of mathematics specific technology to support understanding of the Discrete Mathematics for Computer Science course is required. Prerequisite: C- or higher in MATH 2600 Prerequisite or Corequisite: none Corequisite: none General Education Code: Quantitative Reasoning (QUAX) Elective Code(s): LART Previous: MAT* 210, MAT* 287
Prerequisites: MATH2600