CR: COMP 2804 Learning Objectives: Difference between revisions

From Soma-notes
Maheshwa (talk | contribs)
Maheshwa (talk | contribs)
Line 3: Line 3:
=Assumed Background=
=Assumed Background=


Learning objectives completed before this course.
* COMP 1805
 


=Learning Objectives=
=Learning Objectives=

Revision as of 18: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.