This course introduces discrete computational structures, methods, and concepts utilized throughout computer science. Topics may include types, logic and proof techniques, induction, relations, functions, equivalence and congruence relations, recursion, order relations, partially ordered sets, lattices, Boolean algebras, semi-groups, monoids, morphisms, languages, graphs, trees, finite state machines, counting and probability. The required credit-bearing laboratory COSC 290L must be taken concurrently with COSC 290. Prerequisites: COSC 102.
The syllabus may not be applicable to the current semester. Be sure to verify content with the professor(s) listed in the document.