Difference between revisions of "CR: COMP 2804 Learning Objectives"
Jump to navigation
Jump to search
(→Topics) |
|||
| Line 3: | Line 3: | ||
=Assumed Background= | =Assumed Background= | ||
* COMP 1805 | |||
=Learning Objectives= | =Learning Objectives= | ||
Revision as of 14:01, 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, Quicsort, Binary Search Trees, Skip Lists.
- Statistics: ?
- Missing: Countability and Relations.