Difference between revisions of "CR: COMP 2804 Learning Objectives"
Jump to navigation
Jump to search
(Created page with "=Calendar Description= =Assumed Background= Learning objectives completed before this course. =Learning Objectives= Objectives for the whole course =Topics= ==Topic 1== …") |
(→Topics) |
||
| Line 12: | Line 12: | ||
=Topics= | =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. | |||
Revision as of 12:41, 10 March 2011
Calendar Description
Assumed Background
Learning objectives completed before this course.
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.