Introduction to Computation
Welcome to the Spring 2019 homepage for COMPSCI 250: Introduction to Computation. More information will be added as the semester nears.
- Lectures: MWF 1:25 - 2:15, Goessman Lab 64
Marius Minea (marius at cs), office: LGRC A261
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, Discrete Mathematics: A 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 versions of the book differ only by the correction of some minor errors.