Difference between revisions of "CR: COMP 2804 Learning Objectives"
Jump to navigation
Jump to search
(→Topics) |
|||
| Line 14: | Line 14: | ||
* Asymptotic Complexity: O, Theta. | * Asymptotic Complexity: O, Theta. | ||
* Probability: Random Variables, Expected Value, Indicator, Markov Inequality, Chernoof Bounds. | * Probability: Random Variables, Expected Value, Indicator, Markov Inequality, Chernoof Bounds. | ||
* Randomized Algorithms: Median, | * Randomized Algorithms: Median, Quicksort, Binary Search Trees, Skip Lists, 2-dimensional Linear Programming. | ||
* Statistics: | * Statistics: Confidence tests and Intervals, Hypothesis Testing. | ||
Revision as of 14:03, 10 March 2011
Calendar Description
Assumed Background
- COMP 1805
Learning Objectives
Objectives for the whole course
Topics
- Counting: Permutations, Combinations, Binomial Coefficients, Pigeon-Hole Principle, Inclusion-Exclusion.
- Asymptotic Complexity: O, Theta.
- Probability: Random Variables, Expected Value, Indicator, Markov Inequality, Chernoof Bounds.
- Randomized Algorithms: Median, Quicksort, Binary Search Trees, Skip Lists, 2-dimensional Linear Programming.
- Statistics: Confidence tests and Intervals, Hypothesis Testing.