CSC 423

Randomized Algorithms

Units: 1.5

Hours: 3-0

Basic techniques in design and analysis of randomized algorithms: moments and deviations, Markov chains and random walks, martingales, and algebraic techniques. Other topics include: the probabilistic method, random structures and complexity. Applications are selected from: parallel algorithm, routing networks, combinatorial optimization, data structure, approximate solutions to intractable problems, cryptography, pattern matching, and computational geometry.


  • CSC 226 with a minimum grade of B+; and
  • minimum third-year standing.

Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.

Fall 2017 Spring 2018 Summer 2018

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."