Loading course details…
Loading course details…
Worcester Polytechnic Institute · 3 credits · UGRD

Cat. I This course introduces the theoretical foundations of computer science. These form the basis for a more complete understanding of the proficiency in computer science. Topics include computational models, formal languages, and an introduction to compatibility and complexity theory, including NP-completeness. Students will be expected to complete a variety of exercises and proofs. Undergraduate credit may not be earned both for this course and for CS 5003. Recommended Background: Discrete mathematics (CS 2022 or equivalent) and algorithms (CS 2223 or equivalent). Students who have credit for CS 4121 may not receive credit for CS 3133.
Fall 2026 · 2 sections
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| A01Class #CS-3133-A01 | T-F10:00 AM - 11:50 AM2026-08-20 - 2026-10-09 | Washburn 229 | Hanmeng Zhan |
| B01Class #CS-3133-B01 |
| Salisbury Labs 115 Kinnicutt Hall |
| Gabor Sarkozy |