Professional Documents
Culture Documents
Sess 2
Sess 2
Probability Session 2
January 3, 2022
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Experiments
sample spaces) 2.3 Addition Rules 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
2.1.1 Random
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
Definition 1.
2.1.1 Random
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
Experiments
Experiments
An experiment that can result in different outcomes, even
though it is repeated in the same manner every time, is called
a random experiment.
Examples 2.0:
Examples 2.0:
1
Select a molded plastic part, such as a connector,
and measure its thickness.
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events Definition 1.
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.1 Random 2.1.4 Counting Techniques
Experiments
Examples 2.0:
1
Select a molded plastic part, such as a connector,
and measure its thickness.
2
Measure the thickness of two connectors.
Examples 2.0:
1
Select a molded plastic part, such as a connector,
and measure its thickness.
2
Measure the thickness of two connectors.
3
By a new car randomly with the conditions: With or without
an automatic transmission; With or without air
conditioning; With one of three choices of a stereo system;
With one of four exterior colors.
Spaces Definition 2.
Spaces
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.2 Sample 2.1.4 Counting Techniques
Spaces Definition 3.
2.1.2 Sample
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
A sample space is discrete if it consists of a finite or
countable infinite set of outcomes.
A sample space is continuous if it contains an interval (either
finite or infinite) of real numbers.
Definition 4.
An event is a subset of the sample space of
a random experiment. PhD. Tri Tuyen Luc Chapter 2.
Probability
2.1.3 Events
Definition 4.
2.1.3 Events
Definition 4.
An event is a subset of the sample space of a random experiment.
2.1.3 Events
Definition 4.
2.1.3 Events
Definition 4.
An event is a subset of the sample space of a random experiment.
Definition 4.
2.1.3 Events
Definition 4.
2.1.3 Events
Definition 4.
An event is a subset of the sample space of a random experiment.
Definition 5.
2.1.3 Events
Definition 5.
Two events, denoted as E1 and E2 , such that
E1 ∩ E2 = ∅ are said to be mutually exclusive.
Probability
2.1.3 Events
Definition 5.
Two events, denoted as E1 and E2 , such that
E1 ∩ E2 = ∅ are said to be mutually exclusive.
Definition 5.
2.1.3 Events
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules 2.1.3 Events
2.1.1 Random Experiments 2.1.2 Sample 2.1.4 Counting Techniques
Spaces 2.1.3 Events
(n − r)!.
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Techniques
sample spaces) 2.3 Addition Rules 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
2.1.4 Counting
(n − r)!.
The number of permutations of similar objects implies that n =
n1 + n2 + · · · + nr where n1 are of one type, n2 are of second
type,..., nr are of rth type is
n!
n1!n2! · · · nr!.
(n − r)!.
The number of permutations of similar objects implies that n =
n1 + n2 + · · · + nr where n1 are of one type, n2 are of second
type,..., nr are of rth type is
n!
n1!n2! · · · nr!.
The number of combinations, subsets of size r that can be selected
from a set of n elements is
Cnr =nr =n!
r!(n − r)!
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Techniques
sample spaces) 2.3 Addition Rules 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
2.1.4 Counting
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.4:
2.1.4 Counting
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
Techniques Example
Techniques Example
A printed circuit board has eight different locations in
which a component can be placed.
- If four different components are to be placed on the
board, how many different designs are possible? P84 =8!4!
= 1680.
Techniques Example
A printed circuit board has eight different locations in
which a component can be placed.
- If four different components are to be placed on the
board, how many different designs are possible? P84 =8!4!
= 1680. - If five identical components are to be placed on
the board,
how many different designs are possible? 85 =8!
5!3! = 56.
A part is labeled by printing with 4 thick
lines, 3 medium lines, and 2 thin lines. How
many different labels can be generated by
using this scheme? 9!
4!3!2! = 1260.
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules
2.2 Interpretations of Probability
PhD. Tri Tuyen Luc Chapter 2. Probability
X
number of outcomes in S= N.
X
number of outcomes in S= N.
2. Relative frequency: