Syllabus 

Course Materials Course Goals Course Policies GradingThree Exams, each worth 25% of the total gradeWednesday, September 18 Final Exam, worth 25% 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 50 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.