| |
Nov 22, 2024
|
|
|
|
|
CS 3013 Discrete Mathematics
(3 hours)
Theory and applications of mathematical models fundamental to analysis of discrete problems. Introduction to set theory, relations and functions. Principles of counting and other combinatorial problems. Introduction to graph theory and its application to algorithm analysis. Formal logic, methods of proof and correctness of algorithms. Recursion and recursive definitions. Prerequisite: MATH 1243 or MATH 2014 , or permission of instructor. Same as MATH 3013 .
Add to Bulletin (opens a new window)
|
|
