CCR

Search

Find a course or a school.

CSE 4313 creditsPrereq: Pre-Requisite: CSE 331 . Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only. Students must complete a mandatory advisement session with their faculty advisor.

CSE 431: Algorithms Analysis and Design

No student reviews yet

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

No ratings yet

We don't have ratings, grades or reviews for CSE 431 yet.

Below: what the catalog says, the CSE classes numbered next to it and how Computer Science and Engineering classes rate at UB.

Yours would be the first. About two minutes, anonymous.

Took CSE 431? How hard was it?

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

Difficulty

What we know

From the catalog
Introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, NP-completeness, approximation algorithms, and network flows. For each topic, beside in-depth coverage, we discuss one or more representative problems and their algorithms. In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer scientists and engineers.
Credits
3

Written reviews

No written reviews of CSE 431 yet

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

Professors who have taught CSE 431

  • Shi Li
  • Xin He