CMPSCI 250: Introduction to Computation

David Mix Barrington

Fall, 2004

This is the home page for CMPSCI 250. CMPSCI 250 is the undergraduate core course in discrete mathematics and will deal with logic, elementary number theory, proof by induction, combinatorics, graphs, finite automata, regular languages, and a brief introduction to Turing machines.

The course is primarily intended for undergraduates in computer science and related majors such as mathematics or computer engineering. CMPSCI 187 (programming with data structures) and MATH 132 (Calculus II) are corequisites and in fact most students in the course have already taken one or both.

The course will meet for three lecture meetings a week, MWF 10:10-11:00. The Monday and Friday meetings will be in Marston 132. The Wednesday lectures, starting with the lecture of 6 October, will be in Chenoweth 227. Thanks to the registrar's office for getting us out of our original inferior classroom.

There are two discussion sections, one meeting Monday 11:15-12:05 and the other Wednesday 12:20-1:10, both in LGRC A203. These will consist of students solving specific problems alone or in groups and handing answers in, so that missing these classes will incur a grade penalty.

There is also an honors section for the course called CMPSCI H11, a one-credit seminar intended for undergraduates in Commonwealth College (but open to non-CC students as well if there is room). In this we will read Hofstadter's Godel, Escher, Bach and discuss how it relates to the topic of the main course. The seminar meets Fridays 2:30-3:20 in room 140 of the Computer Science building.

Important Course Material:

Announcements (23 December 2004):

Last modified 23 December 2004