Fall 98, CSE 468: Syllabus

Instructor: Catuscia Palamidessi
Email: firstname@cse.psu.edu
Office: 325 Pond
Office Hours: Monday, Wednesday 11:00-12:00, and by appoinment.
Phone: 863-3599

Lectures: M,W,F - 4:40-5:30, in 106 Boucke
Midterm: 27 Oct 98, 8:15-10:15pm in 267 Willard
Final: 16 Dec 98, 2:30-4:20pm in 106 Boucke

Course Description: An introduction to the modern theory of computing: automata theory, formal languages, and effective computability. The capabilities and limitations of abstract computing devices are investigated from a theoretical perspective. See also the detailed description of the contents of the course.

Assignments: There will be approximately 6 assignments. These are very important. They are how you really learn the material. In general, it is not possible to succeed in the course without doing the assignments: some exam questions will be based on your understanding of the assignments.

Assignments are due at the start of class on the date specified. They will be accepted after that time until the start of the next class period with a 20% penalty. No submission will be accepted after this time.

Academic Integrity: In exams and assignments, every student is expected to submit only their own original work, or where applicable, to cite the source of the solution. Such sources include the textbook, other books, and other individuals. The exception is material presented or distributed in class which can be used freely. It is reasonable (and even encouraged!) to discuss with other students the problems of the assignments. However, it is not acceptable to work together on the details of a solution, to copy a solution, or to give away a solution. If your common discussion can be detected by looking at the solutions, then there has been too much collaboration. Such instances of academic dishonesty will result in a failing course grade.

Grading: Final grades will be determined via a combination of the assignments (40%), the midterm examination (30%) and the final examination (30%).