Syllabus  
 

Go To Sessions
Course Materials Course Goals Course Policies GradingThe grade will be determined as follows: Homework, worth 10% of the total gradeThree Exams, each worth 22% of the total gradeExam dates: Wednesday, September 17 Wednesday, October 15 Wednesday, November 12 Final Exam, worth 24% of the total gradeCourse Term
Basics:
Mathematical Notions and Methods of Proof (Chapter 0) Regular
Languages and Finite Automata (Chapter 1) ContextFree
Languages and Pushdown Automata (Chapter 2) Turing
Machines and the Notion of Algorithm (Chapter 3) Decidability
(Chapter 4) Reducibility
(Chapter 5) Time
Complexity (Chapter 7) This page has been viewed 590 times since August 6, 2002. 
Home Instructor Syllabus Course Content Discussion Area GradeBook Web Links Student Registration Courses 
Portions
copyright ©2002 The McGrawHill Companies.
Any use is subject to the Terms of Use and
Privacy
Policy.
McGrawHill Higher Education is one of the many fine businesses
of The McGrawHill Companies.