| |
Dec 19, 2024
|
|
|
|
|
CS 3000 - Introduction to Discrete Structures
Discrete mathematics and its application to computer science explored. Foundational mathematical techniques used in computer science are explored in depth: propositional logic, number theory and proofs, sequences and mathematical induction, set theory, counting and combinatorics, discrete probability, functions, recursion, simple analysis of algorithms, and orderings and relations. Applications of these structures to various areas of computer science also covered.
Requisites: CS 2400
Credit Hours: 4
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture, 1.0 recitation
Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Add to Portfolio (opens a new window)
|
|
