CS 332 Home Page - FALL - 2002

Welcome to the home page for the Computer Science Department's Theory of Computation course CLA CS 332. This is the starting point for online course information and documentation.

The Teaching Assistant this semester is Ben Hescott.
His office hours are M 10-11 and Tues. 1-3 in room MCS 147, his office phone is 358-2376.

The three sections for the course are:
M 2-3 in MCS B31
F 10-11 in MCS B33 (new section)
F 11-12 in MCS B31

Here is the most recent CS 332 Course News.

Here is an example final.

Here is the current homework, HW7,
and the past homeworks, HW1 | HW2 | HW3 | HW4 | HW5 | HW6
and some answers to past homework, HW1-ANSWERS | HW2-ANSWERS| HW3-ANSWERS | HW4-ANSWERS | HW5-ANSWERS| HW6-ANSWERS| HW7-ANSWERS.

Here is an overview of course policy.

CS 332 is the main undergraduate course in computability theory and complexity within the computer science curriculum. Sudents will learn about Turing machines, universal computation, Church's thesis, decidability, reductions, a variety of unsolvable problems, resource bounded complexity, and common complexity classes.

The following list of pointers provides access to information concerning the course.

• Course Information
  • Syllabus
  • Homework
  • A short bibliography of complexity texts

• Computer Science Department Information
  • CS Department Home Page
  • CS Department Computing Resources
  • Other Departmental Resources

• Help and Other Places in Cyberspace (courtesy of A. Kfoury)
  • A Historical Note on Algorithms
  • Steve Seiden's Cheat Sheet(ten pages of commonly used formulas in computer science).