| |
Dec 14, 2025
|
|
|
|
|
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 acquire knowledge of classical facts from elementary number theory.
- Students will develop the ability to analyze the efficiency of simple recursive and iterative algorithms, and to use O notation.
- Students will develop the ability to manipulate sequences and utilize proof by mathematical induction.
- Students will develop the ability to read logical arguments and mathematical proofs.
- Students will develop the ability to write coherent mathematical proofs.
- Students will gain an understanding of basic set theory, including Russell’s paradox.
- Students will gain an understanding of counting and combinatorics up to, and including the binomial theorem.
- Students will gain an understanding of the logic of compound statements and the logic of quantified statements.
- Students will understand the basic concepts of relations: equivalence relations and partial orders.
Add to Portfolio (opens a new window)
|
|
