CSE 331Prereq: CSE 250 and MTH 142
CSE 331: Algorithms and Complexity
63 public student ratings, updated Oct 2026 · no written reviews yet
Undergrad registration for Spring 2027 at UB opens Mon, Nov 2. Registrar dates
From 63 public student ratings
Ratings are mixed. It's demanding, and good grades are within reach.
No written reviews yet. Yours would be the first.
Took CSE 331? How hard was it?
1 is easy, 5 is hard. Anonymous, no account.
Difficulty
What we know
- From the catalog
- Design and analysis of algorithms. Divide and conquer, dynamic programming, greedy methods, graph algorithms, NP-completeness, and approximation algorithms.
- Ratings across the web
- 3.0 out of 5 stars3.0from 63 ratings
- Department
- Computer Science and Engineering
Written reviews
No written reviews of CSE 331 yet
Took it? Add yours when you have a couple of minutes. Anonymous, no account, no email.
Professors who have taught CSE 331
- Ahmet Erdem Sariyuce
- Atri Rudra
- Farshad Ghanei
- Jesse Hartloff
- Nasrin Akhter
- Russ Miller
- Thomas Hayes
- Yorah Bosse
Questions students ask
Classes next to CSE 331
CSE courses at UB with the closest numbers
- CSE 305Introduction to Programming Languages3.4 out of 5 stars3.4· difficulty 77/100· 44 ratings
- CSE 306Software Quality in Practice4.8 out of 5 stars4.8· difficulty 60/100· 5 ratings
- CSE 312Introduction to Web Applications3.3 out of 5 stars3.3· difficulty 66/100· 16 ratings
- CSE 321Real -Time and Embedded Operating Systems2.9 out of 5 stars2.9· difficulty 60/100· 18 ratings
- CSE 331Algorithms and ComplexityThis class
- CSE 341Computer Architecture2.7 out of 5 stars2.7· difficulty 76/100· 130 ratings
- CSE 365Introduction to Computer Security3.6 out of 5 stars3.6· difficulty 81/100· 18 ratings
More Computer Science and Engineering at UB
- CSE 115Introduction to Computer Science I
- CSE 250Data Structures
- CSE 116Introduction to Computer Science II