CSC250 Theoretical Foundations of Computer Science
Mon, Wed 1:10-2:30 Room Ford Hall 241
Prereqs: csc111 and math 153 (153 may be taken concurrently),
or permission of instructor (jfrankli at smith.edu)
We study, in brief, models of languages and machines: automata and finite state machines; regular sets and regular languages; push-down automata and context-free languages; computability and Turing machines.
Text: Introduction to Computer Theory, Second Edition
Daniel I. A. Cohen
- Come to class all the time.
- Read the text and do the homework all the time.
- Be curious about models of languages and machines that can recognize them.
|Admire Alan Turing:
- Be ready to understand the grammar for python
Syllabus: Under Construction!
- Homework - 50%
- Pattern Matching lab - 10%
and PM homework
- Take-home Exams (mid-term and final) - 25%
- Final Project - 15%
- Team or sole presentation of a paper from the literature on the theory of and applications of the theory of Computation.
- Office Hours (355 Ford Hall):
or by appt. (email email@example.com)
- TA: Shannon MacKenzie
- Help Session: Sundays 2-4 Ford Hall 342
- Links to web pages with final project topics