TTh 8:40am–9:55am · TTh 10:10am–11:25am · TTh 11:40am–12:55pm
3 distinct times across 3 sections.
2 of 3 sections have room
Prerequisites Prerequisites: (COMS W3203)
Description
CC/GS: Partial Fulfillment of Science Requirement Corequisites: COMS W3134,COMS W3136,COMS W3137 Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness.
Reviews
Course experience
n=52, 2000–2026
Aggregated across everyone who has taught this course.
Teaching quality
4.2 / 5
Grading fairness
4.0 / 5
Workload
4.0 / 5 · Heavy
Difficulty
3.5 / 5 · Hard
Overall sentiment
Positive
Sections3
- Full
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
- 1 of 105 seats left
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
- TTh 11:40am–12:55pm · SEELEY W. MUDD BUILDING MUD 63368 of 70 seats left
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
In your week
Workload and grading
- Grading
- Not published
- Format
- Not published
- Credits
- 3 credits
Reported workload
From CULPA and Reddit reviews matched to this course.
No reviews matched yet.