Computer Science (CSC) Courses>Randomized Algorithms

CSC423 - Randomized Algorithms

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Prerequisites

  • Complete all of the following
    • Earn a minimum grade of B+ in each of the following:
      • CSC226 - Algorithms and Data Structures II (1.5)
    • minimum third-year standing.

Course offered by

Department of Computer Science

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.