Detailed Course Information |
Fall 2023
Dec 21, 2024 |
|
 |
||
 | Select the desired Level or 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 Restrictions: May not be assigned one of the following Student Attributes: DGCE Student Prerequisites: PREREQ for CSCI 317 General Requirements: ( Course or Test: CSCI 271 May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( May not be taken concurrently. ) and ( Course or Test: MATH 215 May not be taken concurrently. ) or ( Course or Test: MATH 206 May not be taken concurrently. ) or ( Course or Test: MATH 292 May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( May not be taken concurrently. ) |
| Return to Previous | New Search |
|