Winter 2000 Syllabus
Week of | Topics | Readings | Work Due |
Jan 24 | Introduction to Theory | Chapter 0 | 0.3-6 |
Jan 31 | Machines | Chapter 1 | 1.1-3, 1.2-1, 1.3-5, 1.4-3, 1.7-2, 1.9-2 |
Feb 7 | Devices and Programs | Chapter 2 | 1.10-1c, 1.10-2b, 1.10-3b, 2.10-4 |
Feb 14 | Simulation | Chapter 3 | 3.3-9(page 190), 3.5-1d,e,f, 3.5-2, 4.2-2 |
Feb 21 | Finite State Machines | Chapter 4 | 4.4-5, 4.6-8, 4.7-11, 4.7-14 |
Feb 28 | Finite State Machines (Continued) | Chapter 4 | 4.8-11, 4.8-13, 4.9-5 |
March 6 | **** Test 1 **** | ||
March 13 | Context-Free Languages | Chapter 5 | |
April 3 | Stacks and Counters | Chapter 6 | |
April 10 | Stacks and Counters | Chapter 6 | |
April 17 | Stacks | Chapter 6 | |
April 24 | Computability | Chapter 7 | |
May 1 | Computability | Chapter 7 | |
May 8 (1/2 week) |
Take-home test | ||
WORK FOR THE COURSE: The work for this course includes class participation, readings, two tests, and numerous assignments. All work will be graded and will contribute to your course grade. Attendance is required for all scheduled classes and lab meetings.
Students are expected to follow Bowdoin's Computer Use Policy and its Academic Honor Code.