Note: This is the 2010鈥�2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click聽here to jump to the newest eCalendar.
Overview
Computer Science (Sci) : Fundamental tools from probability are used to analyze algorithms. Notions covered included independence, generating functions, probability inequalities, random walks and Markov chains. Analysis of probabilistic recurrences, Las Vegas algorithms, randomized approximation algorithms, random sampling methods, Monte Carlo techniques and algorithms for combinatorial search and graph theoretic problems.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- 3 hours
- Prerequisites: COMP 251 and MATH 323