CSC 423

Randomized Algorithms

Units: 1.5

Hours: 3-0-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.

Prerequisites:

  • 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.

Schedules:
Summer 2018 Fall 2018 Spring 2019

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.