CMPSCI 250: Introduction to Computation

David Mix Barrington

Spring, 2005

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.

Instructor Contact Info: David Mix Barrington, 210 CMPSCI building, 545-4329, office hours Monday 10-12, Thursday 1-3.

TA Contact Info: Nadia Ghamrawi, office hours Tuesday 4-5, Wednesday 3-4 in LGRT 220.

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 both.

The course will meet for three lecture meetings a week, MWF 1:25-2:15 in Lederle A301 (the low-rise).

There are two discussion sections, one meeting Monday 2:30-3:20 and and the other Wednesday 11:15-12:05, both in Lederle 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 11:15-12:05 in Room 140, Computer Science Building, starting Friday 4 February.

Important Course Material:

Announcements (19 May 2005):

Last modified 19 May 2005