Discrete Mathematics
Download as PDF
General
Course Title
Discrete Mathematics
Min
3
Description
A study of basic techniques and modes of reasoning of combinatorial problem-solving. Sets, functions, and algorithms; counting methods and recurrence relations; graph theory; trees; network models Boolean algebra and combinatorial circuits; . Fall, Spring Prerequisites: MATH 1303, 2309, and COSC 1405, or permission of instructor. Crosslisted: MATH 3302
Prerequisite
10 A Requirement block where all subrequirements are required
TAKE MATH*1303,MATH*2309,COSC*1405; MIN GRADE OF D- A Subrequirement block where all groups are required
30 (ALL COURSES): Take all of the following courses...