CSE 303Prereq: CSE 215 or CSE 150; CSE 214 or CSE 260
CSE 303: Introduction to the Theory of Computation
60 ratings across the web · no written reviews yet
Planning Spring 2027? Save classes to your plan.
From 60 ratings across the web
Ratings are mixed. It's demanding, and good grades are within reach.
No written reviews yet. Yours would be the first.
Took CSE 303? How hard was it?
1 is easy, 5 is hard. Anonymous, no account.
Difficulty
What we know
- From the catalog
- Introduction to the mathematical theory of computation, covering automata theory, formal languages, computability, and complexity theory including NP-completeness.
- Ratings across the web
- 2.3 out of 5 stars2.3from 60 ratings
- Department
- Computer Science
What students say
Be the first to review CSE 303
Six short steps, about two minutes. Anonymous, no account, no email.
Questions students ask
Classes next to CSE 303
CSE courses at Stony Brook with the closest numbers
- CSE 216Programming Abstractions2.5 out of 5 stars2.5· difficulty 77/100· 30 ratings
- CSE 219Computer Science III3.3 out of 5 stars3.3· difficulty 75/100· 58 ratings
- CSE 303Introduction to the Theory of ComputationThis class
- CSE 316Fundamentals of Software Development3.4 out of 5 stars3.4· difficulty 71/100· 19 ratings
- CSE 320Systems Fundamentals II3.9 out of 5 stars3.9· difficulty 86/100· 57 ratings
- CSE 337Scripting Languages2.4 out of 5 stars2.4· difficulty 82/100· 40 ratings
- CSE 373Analysis of Algorithms4.0 out of 5 stars4.0· difficulty 74/100· 38 ratings