Meeting Time: 2:00-3:15 TTh Meeting Place: HES 236
Instructor: M. Samadzadeh Office: MSCS 215 Phone: 744-5674
Office Hours: 11:30-12:15 Monday, Tuesday, Wednesday, Thursday, or by appointment
Grad. Asst.: Haibiao Ding Office: MSCS 316 Phone: 744-7277
E-mail Address: haibiao@a.cs.okstate.edu
Office Hours: 12:30-1:30 Tuesday and Thursday, 1:20-2:20 Friday, or by appointment
Prerequisites: CS 2133 (Computer Science II) and CS 3653 (Discrete Mathematics II)
Required Text:
· John C. Martin, Introduction to Languages and the Theory of Computation, Second Edition, McGraw-Hill, Inc., New York, NY, 1997.
Course Description: Introduction to the classical theory of computer science. Sequential machines and their applications to devices, processes, and programming. Models of computation: finite state automata, push down automata, Turing machines. The role of non-determinism. Limits of digital computation. Computability and unsolvability. The Church-Turing Thesis.
Grading: Homeworks 25%
Tests (3) 15% each (September 13, October 16, November 13)
Final Exam 30% (December 11, 2:30 - 4:20 PM) comprehensive
Letter Grades: [90-100] A, [80-90) B, [70-80) C, [60-70) D, [0-60) F
Note: Homeworks are due at the beginning of class on the date they are due (unless announced in class otherwise). Late Homeworks will not be accepted. Only when verifiable extenuating circumstances can be demonstrated will make-up exams or extended assignment due dates be considered. Verifiable extenuating circumstances must be reasons beyond control of the students, such as illness or accidental injury. Poor performance in class is not an extenuating circumstance. Advise your instructor of the verifiable extenuating circumstances in advance or as soon as possible. In such situations, the date and nature of the make-up exams and the extended due dates for the assignments will be decided by the instructor.
Attendance Policy: Attendance is strongly encouraged, but not required or monitored. Students are responsible for all material covered in class. Some of the material covered in class may not be in the text book. Announcements about homeworks, due dates, etc. will be made in class and/or by email. Students are to check their emails regularly (using their class accounts).
Homework: Discussion of any kind is allowed. After discussion, each student must write up his/her own solution. Copying another student's work is not allowed. Giving another student your work is considered cheating as well.
Examinations: No discussion of any kind (except with the instructor) is allowed. No access to any type of written material is allowed.
Students who do not comply with the described collaboration policy will receive a grade of F in the course. Furthermore, the case will be reported to the University Officials.
Attachments:
· Important Dates for Fall 2001 Semester
· Computer Science Department General Computer Use and Misuse Policy
· Academic Dishonesty Policy
· Disabilities Act
· Fall 2001 Calendar
· Oklahoma State University Syllabus Attachment for Fall 2001