Catalog Entries |
Fall 2024
Jul 09, 2025 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CSCI 317 - Discrete Structures |
|
An intermediate to advanced course on discrete mathematical structures used in computer science. Students study abstract structures used to represent discrete objects and the relationships between these objects. Topics include principles of logic, incompleteness, diagonal proof, inductive proof, t and correctness of simple algorithms. Coverage of set theory extends to relations, graphs, functions, countability, formal languages, and non-well-foundedness. Students write recurrences to define computable functions and explore discrete probability and randomness from a computational viewpoint.
Prerequisites: CSCI 271 Data Structures and either MATH 206 Discrete Mathematics I or MATH 215 Finite Mathematics.
1.000 Credit hours 4.000 Lecture hours Levels: Non-Matriculated, Undergraduate Schedule Types: Directed Study, Lecture Computer Science Department Course Attributes: Undergraduate Level Course |
|