| Time | Days | Location | Instructor | GER | Credit | OPUS Class Number | Syllabus (Tentative) |
|---|---|---|---|---|---|---|---|
3:00pm-4:15pm | MW | Math & Science Center - W301 | James Lu. | MQR. | 4 | 12584 | TBA. |
January 13, 2010- April 26, 2010
Prerequisites: CS 253 and CS 224
Catalog Description: Spring. Prerequisites: Computer Science 224 and 323. This course gives mathematical methods to classify the complexity of computational problems. Topics include regular languages, grammars, decidability, and NP-completeness. Models of computing such as automata, circuits, and Turing machines are related.
Semester Details: This course gives mathematical methods to classify the complexity of computational problems. Topics include regular languages, grammars, decidability, NP-completeness, and corresponding models of computation.
The schedule of courses on O.P.U.S. is the official listing of courses, including days and times they meet and the General Education Requirements they satisfy. Students should use course descriptions as general guidelines. Course requirements, grading details, book lists, and syllabi are subject to change.