MidTerm Flashcards

1
Q

P( A or B ) =

A

P( A or B ) = P( A ) + P( B ) - P( A and B )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

P( A or B or C ) =

A

P( A or B or C ) = P( A ) + P( Ac and B ) + P( Ac and Bc and C )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

| equals what 2 equations?

y - x | > .3

A

y > x + .3 and y < x - .3

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Set A = area(A)
Uni Set = area(Uni)
what is the probability of set A?

A

area(A)/area(Uni)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

when calculating continuous probabilities we use _____ instead of ______

A

area instead of # of elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

when calculating discrete probabilities we use _____ instead of ______

A

of elements instead of area

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

P( A | B ) = ?

A

P( A | B ) = P( A and B ) / P( B )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

P( A & B ) = ?

A

P( A and B ) = P( B ) * P( A | B )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

P( Bc | A ) = ? (if B and Bc are all possibilities)

A

P( Bc | A ) = 1 - P( B | A )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

P( A1 & A2 & A3) = ?

A

P( A1 and A2 and A3 ) = P(A1) * P( A2 | A1 ) * P( A3 | A1&A2 )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How many decisions (depth) would a tree have with P( A1 & A2 & A3 & A4)

A

4 deep

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Best way to do multiplication rule? When a question asks you for P( A & B & C )

A

use a decision tree and map out
P( A ) * P( B | A) * P( C | A&B )
br1 * br2 * br3

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Total Probability Theorem

P( B ) = ?

A

Assume A1, A2, A3 …. An are disjoint and are added up to equal the universal set then
P( B ) = P( A1 ) * P( B | A1) +P( A2 ) * P( B | A2 ) + P( A3 ) * P( B | A3 ) ….. + P( An ) * P( B | An)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

multiplication rule

A

P( A1 & A2 & A3 ) = P( A1 ) * P( A2 | A1 ) * P( A3 | A1 & A2 )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

total probability rule formula

A

P( B ) = P( A1 & B ) + P( A2 & B ) + … + P( An & B )
which turns into
P( B ) = P( A1 ) * P( B | A1 ) + P( A2 ) * P( B | A2 ) + … + P( An ) * P( B | An )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Baye’s Law

A

P( Ai | B ) = [ P( Ai ) * P( B | Ai ) ] / P( B )
and
P( B ) = P( A1 ) * P( B | A1 ) + P( A2 ) * P( B | A2 ) + … + P( An ) * P( B | An )

17
Q

Given P( B | A ) and we want to find P( A | B ) what should we use?

A

Baye’s Law

P( Ai | B ) = [ P( Ai ) * P( B | Ai ) ] / P( B )

18
Q

First step in reading a probability probem

A

IDENTIFY THE GIVENS

19
Q

If we know A & B are independent sets:
P( A & B ) = ?
P( A | B ) = ?
P( B | A ) = ?

A

P( A & B ) = P( A ) * P( B )
P( A | B ) = P ( A )
P( B | A ) = P ( B )

20
Q

Binomial Probability (if we care about order)

A

where p is probability of first outcome (Heads) and 1-p is probability of second outcome (Tails) and n is the number of trials and k is the desired number of first outcome desired.
P(k) = p^k * (1-p) ^(n-k)

21
Q

Binomial Probability (if we don’t care about order)

A

( n choose k ) p^k (1-p)^(n-k)

22
Q

(n choose k) = ?

A

n! / k! (n-k)!

23
Q

How many combinations can we have with n distinct letters?

A

n!

24
Q

How many combinations can we have with n distinct letters and we pick k without replacement?>

A

n! / ( n-k )!

25
Q

If we have multiple repeating letters and a total number of letters = t then how do we calc? x y z are the repeating lettters.

A

t! / #ofx! #ofy! #ofz!

26
Q

total number of objects = t
total number of objects is partitioned into 3 categories. p1 p2 and p3 (represent the number need for each partition)
how many combinations?

A

t! / p1! p2! p3!

27
Q

how to calculate combinations? n total items pick k

A

n! / k! ( n-k )!