CCR

Search

Find a course or a school.

CSE 4323 creditsPrereq: Pre-requisite: CSE 331 and ( EAS 305 or EE 305 or MTH 411 or STA 301 and STA 301 ). Computer Science, Computer Engineering, or Bioinformatics majors only.

CSE 432: Randomized 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 432 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 432? How hard was it?

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

Difficulty

What we know

From the catalog
This course explores applications of probabilistic techniques to computer science. The main focus is how to leverage randomness in algorithms and how to perform probabilistic analysis of algorithms. Randomized algorithms are often faster and simpler than their deterministic counterparts, with the weaker assertion that correctness is not always guaranteed. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms and sampling techniques. Topics include probabilistic method, balls and bins, random graphs, random walks, discrete time Markov chains, the Monte Carlo method, and examples of applications in many areas of computer science.
Credits
3

Written reviews

No written reviews of CSE 432 yet

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