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