|
| Home | People | Curriculum | Projects | Resources | Media |
Instructor: John Dougherty
Semester & Year: Spring 2002
Schedule:
Texts:
Prerequisites: CMSC 206 (Data Structures), Math/CS 231 (Discrete Math), and another 200 level mathematics course or consent of the instructor.
Description: An introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity.
Assignments: Problem sets will be assigned and due (roughly) each week. Assignments must be completed carefully, clearly, and in a timely fashion. Illegible or otherwise unacceptable assignments will not be considered.
Examinations: There are two exams scheduled: a midterm exam which should be available before midterm break and due after break, and a final exam during finals period. Each exam is comprehensive up to the material covered at that point, although the final will emphasize material after the initial exam. Exams are closed book/notes and timed.
Evaluation: Final Grades for the course will be determined based on your work throughout the term
Policy: All course participants (i.e., students and instructor) are expected to abide by the Haverford College Honor Code. Students can collaborate extensively with the instructor during class, discussion and office hours. Students are encouraged to collaborate among themselves and other appropriate persons about course material and the clarity of each assignment; however, each student must complete the assignments and exams individually.
The course syllabus is available on-line.
|
|
