CSC 221 Course Syllabus, Fall 2003

CSC 221: Foundations of Computer Science (3 credit hours)

Description and Prerequisites

This course will provide students with a broad perspective of computer science and will acquaint them with various formal systems on which modern computer science is based. Students will study the structure and interpretation of four (sic) classes of abstract computing machines.
Prereq: CSC 212

Course Outline

1. Mathematical Preliminaries
2. Finite Specification of Languages
3. Regular Languages
4. Finite Automata
5. Context-Free Languages
6. Pushdown Automata
7. Turing Machines
8. The Chomsky Hierarchy
9. Decidability and Computability

Books

Both books are on reserve.

• (Text) Sudkamp Languages and Machines: An Introduction to the Theory of Computer Science (2nd ed) Addison-Wesley 1997 ISBN 0-201-82136-2 Your reading assignments and homework problems will be from this book.
• (Optional) Cohen Introduction to Computer Theory Wiley This book goes to great lengths in explaining all the concepts that will be covered in class. Very easy reading. Examples are abundant and excellent.

Grading

• Homework problems are assigned by chapter and posted on the web.
• A 10-minute quiz will be given approximately each week through the end of the semester, beginning the second week of classes. The semester quiz grade is computed as the sum of all quiz grades, minus the lowest quiz grade, normalized to 100.
• One or two written papers. These will be take-home, and are to be typed. One of these papers will be assigned to be due during finals week. Grades for written papers are in three categories: High-Pass, Pass, Fail.
• Optional challenge problems Individual or group solutions will be accepted for grading. You will be credited with challenge points = difficulty_level / group_number. If you find the solution elsewhere, you must cite the source(s).
• Final Grade Calculation:
  1. You must receive passing grade(s) on all written paper(s) in order to pass the course.
  2. Your numerical grade is your semester quiz grade.
  3. Your total challenge points and expository writing paper(s) will be used for assigning your final letter grade.
  4. Grades are not curved.

Letter Grades

A 92-100 | A- 90-91 | B+ 86-89 | B 82-85 | B- 78-81 | C+ 75-77 | C 70-74 | C- 66-69 | D+ 64-65 | D 62-63 | D- 60-61 | E below 60

Additional Information

• The Computer Science Department's policy on cheating is at here.
  • The minimal penalty will be -maximum grade for a quiz for all parties involved. Additional actions may be initiated if deemed appropriate.
  • With regards to the writing problems, you may discuss general "conceptual" issues with others and consult any books, etc., but the work is to be done by you. As for any scholarly work you find which provides you information to the solution, you must cite those sources in a bibliography.

    Evidence that you have have not cited sources, or that another or others have contributed significantly to your work, or both, will result in failure in the course, or worse.

• Students are expected to have a mathematical background in elementary set theory, propositional logic, functions and relations (from high school). Precalculus (MAT 120) and/or Discrete Mathematics (MAT 215) are/is highly desirable.
• This is a fast-paced course! It is in your best interest to stay on top of the material and do all homework. If you have difficulty with the course: see a CSA volunteer (look for fliers around the building) sign up for tutor; attend help sessions; discuss the situation with me (during office hours and by appointment). Do not wait until it is too late!
• Written assignments are due at the end of class on the due date. Late assignments will not be accepted.
• There are no makeup quizzes.
• Requests to make up quizzes or hand in written assignments late will rarely be permitted unless accompanied by a written medical excuse. If missing a quiz is unavoidable, you must notify me sufficiently beforehand. (An hour before class is not deemed sufficient.)