CS 310 - Discrete Computational Structures

Description: Finite and discrete algebraic structures relating to computers: sets, functions, relations. Machine-oriented logic. Combinatorial problems and algorithms. Finite automata and formal language theory.

Prerequisites: MATH 110 or 105, 122, 221 and CS 210.

Note: It is recommended that students take STAT 151 in addition to prerequisite before attempting CS 310.
Credit Hours: 3

Class Hrs./Week:
3

Lab Hrs./Week:
0

Hardware: None

Software: None
To Top of Page