| |
Dec 26, 2024
|
|
|
|
|
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
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture, 1.0 recitation
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Students will be able to express an understanding of the classical facts of elementary number theories.
- Students will be able to analyze sequences and to employ mathematical induction to demonstrate their correctness.
- Students will be able to express their understanding of basic set theory through both element and algebraic proofs.
- Students will be able to apply their understanding of the logic of quantified statements to construct a proof of the logical truthfulness of a statement.
- Students will be able to analyze the probability of certain outcomes with an understanding of combinatorics.
Add to Portfolio (opens a new window)
|
|
