Basic mathematical objects, logic, number representations, discrete probability, recursion and recursive programs, proof techniques, finite state machines, languages and strings, pushdown automata, asymptotics and complexity, computability and undecidability, and future computing trends.

Usually Offered:	Fall and Spring
Credit:	3 hours (class)
Prerequisite:	CS 180 and MA 161
University Catalog:	CS 182
Schedule:	Fall 2003 Instructor: Wojciech Szpankowski
Syllabi:	Canonical