Colgate University Computer Science Department

This course introduces discrete computational structures, methods and concepts utilized throughout computer science. Topics include sets, relations, functions, equivalence and congruence relations, induction and 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. In the required credit-bearing weekly two-hour laboratory, students acquire concrete experience experimenting with and implementing the concepts and structures introduced in the lecture.

Format: Lecture and two-hour laboratory.

Prerequisites: COSC 101 and Math 111

COSC Course Offerings for Spring 2008