CS 5000D - 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

Credit Hours: 4.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture, 1.0 recitation

Eligible grades: A-F,WP,WF,FN,FS,AU,I