COSC 290 - Discrete Structures

This course introduces discrete computational structures, methods, and concepts utilized throughout computer science. Topics include types, relations, functions, equivalence and congruence relations, recursion, order relations, partially ordered sets, lattices, Boolean algebras, logic, semi-groups, monoids, morphisms, languages, graphs, trees, and finite state machines. Concrete and abstract data types, circuits, syntactic and semantic program structures provide standard motivating examples and applications.

Credits: 1.00
Corequisite: COSC 290L
Prerequisites: COSC 102
Major/Minor Restrictions: None
Class Restriction: None
Area of Inquiry: Natural Sciences & Mathematics
Liberal Arts CORE: None

Click here for Course Offerings by term