exam 2 Flashcards

(62 cards)

1
Q

probability

A

measure of the likelihood of a random phenomenon or chance behavior occurring

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

experiment

A

a process with uncertain results that can be repeated

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

event

A

any collection of outcomes from a probability experiment

- Notation: E

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

simple event

A

an event with only one possible outcome

- notation: e sub i

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

sample space

A

a collection of all possible outcomes in a probability experiment
- Notation: S

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

rules of probability

A

1) 0 = P(E) = 1

2) Sum of p(ei) = 1

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

P(E) < 0.05

A

unlikely

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

probability model

A

lists all possible outcomes of a probability experiment and each outcomes probability
- table must satisfy rules of probability

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

empirical method

A

used when an experiment is actually performed

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

Formula for empirical method

A

P(E) = frequency of E / number of trails in experiment

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

law of large numbers

A

as the numbers of repetitions of a probability experiment increases, the proportion with which a certain outcome is observed gets closer to the actual probability of the outcomes

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

classical method

A

relied on counting techniques. All outcomes MUST be equally likely

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

formula for classical method

A

P(E) = number of ways E can occur / total number of possible outcomes

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

disjoint

A

have no outcomes in common

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

for disjoint events

A

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

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

in general

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
17
Q

or –>

A

either or

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

and –>

A

both

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

sample space notation

A

S

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

simple event notation

A

e sub i

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

event notation

A

E

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

permutation

A

the number of arrangements of r objects chosen from n objects where
The n objects are distinct
Repetition is not allowed
Order matters

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

combinations

A

the number of arrangements of r objects chosen from n objects where
The n objects are distinct
Repetition is not allowed
Order does not matter

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

Notation of complement

A

E^c

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Formula of complement
P(E^c) = 1 - P(E)
26
rules for discrete
Sum of P = 1 | 0 = P = 1
27
mean of a discrete random variable
the mean outcome of an experiment if it was repeated many many times
28
multiplication rule (independent events)
P(A and B) = P(A)*P(B)
29
at least one probabilities
P(at least one ___) = 1- P (none ____)
30
computing probabilities
- calculator
31
notation of conditional probability
P(F|E)
32
conditional probability rule
P(F|E) = P(E and F) / P(E)
33
general multiplication rule
P(A and B) = P(A) * P(B|A) | - for dependent events
34
probability density function (pdf)
an equation used to compute probabilities of continuous random variables
35
permutation
- the number of arrangements of r objects chosen from n objects where - The n objects are distinct - Repetition is not allowed - Order matters
36
permutation notation
n^p r ``` n = sample size p = permutation r = what you're looking for ```
37
permutation calculator
n 9P4 | - Type in 9 -> Math -> PRB -> nPr -> type in 4
38
permutation formula
nPr = n! / (n-r)!
39
combinations
- the number of arrangements of r objects chosen from n objects where - The n objects are distinct - Repetition is not allowed - Order does not matter
40
combinations notation
nCr
41
combinations calculator
nCr = n! / (n*r) ! n!
42
combinations formula
n -> Math -> PRB -> nCr -> r
43
random variable notation
X
44
symbol for mean discrete random variable
u sub X
45
calculator for mean discrete random variable
1-var stat (L1, L2)
46
STDEV for DRV symbol
long tail o sub x
47
STDEV for DRV calculator
1-varstats (L1, L2)
48
N
number of trials
49
P
probability of success
50
1-P
probability of failure
51
X
number of successes
52
computing probabilities
P(x = #) = binompdf (n, p, x) P(x <= #) = binomcdf (n, p, x)
53
mean and STDEV formula
ux = n * p | long tail ox = square root of n*p*(1-p)
54
2 properties of pdf
1. total area under the equation of the graph is 1 | 2. height of the graph of the equation is always >= 0
55
continuous random variable properties
- symmetic about u - mean = mean = mode - inflection points at u +- STDEV - area under curve = 1 as x approaches +- infinity, graph never crosses the x axis - the empirical rule applies
56
normal scores
expected z scores of data, assuming the random variable is normally distributed
57
binompdf
for exact - (n, p%, x) - 2nd vars -> (n, p, x)
58
binomcdf
for range - (n, p%, x) - 2nd vars -> (n, p, x)
59
finding area with calculator
normalcdf(lower bound, upper bound, u, STDEV)
60
find value of normal random variable
invnorm (area to L, u, STDEV)
61
binomcdf
for range - (n, p%, x) - 2nd vars -> (n, p, x)
62
if given area to right
invnorm (1-R, u, STDEV)