Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 310 - Discrete Computational Structures
Finite and discrete algebraic structures relating to computers; sets, functions, relations. Machine-oriented logic. Combinatorial problems and algorithms. Finite automata and formal language theory. *Prerequisite: One of MATH 110 or 105; and MATH 122, MATH 221, and CS 210.* Note: It is recommended that students take STAT 160 or STAT 200 in addition to the prerequisite before attempting CS 310. 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate

CS 310 - Discrete Computational Structures

Finite and discrete algebraic structures relating to computers; sets, functions, relations. Machine-oriented logic. Combinatorial problems and algorithms. Finite automata and formal language theory. ***Prerequisite: One of MATH 110 or 105; and MATH 122, MATH 221, and CS 210.*** *Note: It is recommended that students take STAT 160 or STAT 200 in addition to the prerequisite before attempting CS 310.*
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Examination

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.