Probability Review
Ok, this class was spent reviewing and studying for the probability test tomorrow. Hopefully we have no crammers for the test. Cramming hurts.
Well, I took almost the exact notes from Mr. Max. So I will post them here.
6 bites for the test
Remember: Double Sided Note Sheet for Test
1. Vocabulary/Terminology
-experiment
-trial
-event
-fundamental counting principle
-ratio/percent/decimal/etc.
-sample space
-fractorial
-permutation
-combination
-sets
-set elements
-independent event
-dependent event
-mutually exclusive
-mutually inclusive
-"with/without replacement"
2. "Pathway Problems" following "Pascal's Triangle Rule"
Be aware of the "Dr. Office" phenomenon type questions
i.e. P(going though) or P(not going through)
3. F.C.P (FUNDAMENTAL COUNTING PRINCIPLE)
a) FACTORIAL NOTATION
n! = n (n-1) (n-2)..... 3x2x1
b) PERMUTATIONS
nPr = n!/(n-r)!
order does matter
n = number of possible selections
r = number selected at a time
context clues: combinations locks, passwords, codes,
(? no repeats), 'words'
For same n, r values permutation is a large number.
c) COMBINATIONS
nCr = n! / (n-r)! r!
order doesn't matter (hence divide by number of selections factorial)
context clues: poker hands, pizza toppings, commitees
For same n, r Combination is a small number.
4. MUTUALLY EXCLUSIVE OR MUTUALLY INCLUSIVE
This is the best way for me to show you how this one works.
Well, I took almost the exact notes from Mr. Max. So I will post them here.
6 bites for the test
Remember: Double Sided Note Sheet for Test
1. Vocabulary/Terminology
-experiment
-trial
-event
-fundamental counting principle
-ratio/percent/decimal/etc.
-sample space
-fractorial
-permutation
-combination
-sets
-set elements
-independent event
-dependent event
-mutually exclusive
-mutually inclusive
-"with/without replacement"
2. "Pathway Problems" following "Pascal's Triangle Rule"
Be aware of the "Dr. Office" phenomenon type questions
i.e. P(going though) or P(not going through)
3. F.C.P (FUNDAMENTAL COUNTING PRINCIPLE)
a) FACTORIAL NOTATION
n! = n (n-1) (n-2)..... 3x2x1
b) PERMUTATIONS
nPr = n!/(n-r)!
order does matter
n = number of possible selections
r = number selected at a time
context clues: combinations locks, passwords, codes,
(? no repeats), 'words'
For same n, r values permutation is a large number.
c) COMBINATIONS
nCr = n! / (n-r)! r!
order doesn't matter (hence divide by number of selections factorial)
context clues: poker hands, pizza toppings, commitees
For same n, r Combination is a small number.
4. MUTUALLY EXCLUSIVE OR MUTUALLY INCLUSIVE
This is the best way for me to show you how this one works.
5. INDEPENDANT/DEPENDANT EVENTS
Context clues: 'with/without replacement',
Mr. Max recommended the use of tree diagrams for these type of questions.
He quoteth, "...tree diagrams will be best friends."
6. COMPLEMENTRY EVENTS
summary
P (A) + P (A') = 1
P(A') = 1 - P(A)
Ok. That is about it. One more image to help you with the test for tomorrow.
And, as is the custom, one joke.
Teacher: "What is seven Q plus three Q?" Student: " Ten Q"Teacher: "You're Welcome."
Very cheesey and brought to you by: http://www.sonoma.edu/Math/faculty/falbo/jokes.html
3 Comments:
It's bright...good post none the less...Bravo.
Oui...votre question est tres, tres, fromage, n'est pas?......
yes, very cheese, mr. max
Post a Comment
<< Home