D.5: Combinatorics and Discrete Probability
From
Poul.murtha (Talk | contribs) |
Poul.murtha (Talk | contribs) |
||
| Line 6: | Line 6: | ||
counting techniques in solving combinatorial and probability problems. | counting techniques in solving combinatorial and probability problems. | ||
''' | ''' | ||
| + | |||
D.5.1 Produce all combinations and permutations of sets. | D.5.1 Produce all combinations and permutations of sets. | ||
Revision as of 23:13, 31 July 2010
Discrete Math Learning modules
D.5 Combinatorics and Discrete Probability: Understand and apply fundamental counting techniques in solving combinatorial and probability problems.
D.5.1 Produce all combinations and permutations of sets.
D.5.2 Calculate the number of combinations and permutations of sets of m items taken n at a time.
D.5.3 Apply basic fundamental counting principles such as The Pigeonhole Principle, Multiplication Principle, Addition Principle, and Binomial Theorem to practical problems.
D.5.4 Solve probability problems such as conditional probability, probability of simple events, mutually exclusive events, and independent events.
D.5.5 Find the odds that an event will occur given the probabilities and vice versa.
These are links to information about combinatorics and discrete probability:
Several video lectures and other resources are available through: ArsDigita University (ADU) from MIT
