COMPSCI 250: Introduction to Computation

Swarna Reddy and Marius Minea

Fall 2019

Topics: COMPSCI 250 is the undergraduate core course in discrete mathematics and will deal with logic, elementary number theory, proof by induction, recursion on trees, search algorithms, finite state machines, and a bit of computability. This course is primarily intended for undergraduates in computer science and related majors such as mathematics or computer engineering.

Prerequisites: COMPSCI 187 (programming with data structures) and MATH 132 (Calculus II) are prerequisites though occasionally one of these can be accepted as co-requisite.

Textbook (required): David Mix Barrington, A Mathematical Foundation for Computer Science. This will be available at Collective Copies in Amherst Center. Prior versions of the textbook that were intended for COMPSCI 250 may be used -- the most recent version of the book has some additional explanations (notably on searching), a few new problems and corrections of minor errors.

This web page will be updated as the Fall 2019 semester nears. See also the page for Spring 2019.
Last updated: 26 March 2019