COMPSCI 250: Introduction to Computation

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.

Basic Information:

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. Part 1 (chapters 1-4) is available as e-book, published by Kendall Hunt. Part 2 is available in printed form at Collective Copies in Amherst Center. Prior versions of the textbook that were intended for COMPSCI 250 may be used. Chapters 1-5 of the current version have quite a few more problems and solved exercises (10 of each per section in each chapter), so getting the e-book is recommended.

The course is using Moodle for quizzes and grades, Piazza (sign up here) for discussion and questions, Gradescope for submitting and grading homework, and the iClicker system for in-class questions.

See also the page for Spring 2019.
Last updated: 8 September 2019