Is CSE491 hard at UB?

Based on 3 student ratings, CSE491 is demanding (difficulty 100/100). Grade accessibility is moderate (50/100), meaning grades are moderately distributed.

How many hours per week is CSE491?

Students rate the workload as heavy compared with other courses. Hours per week are not reported for this class.

What is the grading like in CSE491?

Grade accessibility for CSE491 is rated 50/100. The grade distribution across student reports is: B: 50%, C: 50%. The course is assessed primarily through exam-heavy methods.

Is attendance mandatory for CSE491?

Attendance importance is rated 50/100. Attendance policies vary by instructor, but showing up is generally recommended.

What type of assignments does CSE491 have?

CSE491 is classified as "Exam-heavy" based on student feedback. Common themes from student ratings include: get ready to read, test heavy, tough grader, lots of homework. Its difficulty score is 100/100, which reads as demanding.

CSE 4913 creditsPrereq: Pre-Requisite: CSE 331 and MTH 309 . Computer Science, Computer Engineering, Electrical Engineering, or Bioinformatics majors only

CSE 491: Introduction to the Theory of Computation

3 public student ratings, updated Oct 2026 · no written reviews yet

Undergrad registration for Spring 2027 at UB opens Mon, Nov 2. Registrar dates

From 3 public student ratings

Ratings are mixed. It's demanding.

No written reviews yet. Yours would be the first.

Took CSE 491? How hard was it?

1 is easy, 5 is hard. Anonymous, no account.

What we know

From the catalog: This course covers standard machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine, the classes of decidable and computably enumerable languages, and subclasses of decidable problems ranked according to complexity. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. Major topics include time and space complexity of Turing machines, reducibility between problems, NP-completeness, and completeness for other classes. Models of probabilistic computation and quantum computation are also explored.
Ratings across the web: 2.6 out of 5 stars2.6from 3 ratings
Department: Computer Science and Engineering

Written reviews

No written reviews of CSE 491 yet

Took it? Add yours when you have a couple of minutes. Anonymous, no account, no email.

Professors who have taught CSE 491

Ken Regan

Questions students ask

Classes next to CSE 491

CSE courses at UB with the closest numbers

More Computer Science and Engineering at UB

All Computer Science and Engineering courses