Discrete Mathematics
Download as PDF
Overview
Subject area
MATH
Catalog Number
141
Course Title
Discrete Mathematics
Department(s)
Description
Discrete mathematics with computer science applications, emphasizing both computations and proofs; recursion and recursive definitions; mathematical, strong, and structural induction; topics from number theory, including primality, modular arithmetic, and congruences; topics from combinatorics, including permutations, combinations, and the Pigeonhole Principle; topics from graph theory, including types of graphs and trees, as well as their properties and applications.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
027115