353 Theory of Computation

A survey of the theoretical bases of computation: computational complexity (including the classes P and NP) and formal models of the semantics of programming languages. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C-: Computer Science 429 (or 310) or 429H (or 310H); and Computer Science 331 (or 357), 331H (or 357H), 341, or 341H.