Chapter 2.

Probability Session 2

PhD. Tri Tuyen Luc

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

An experiment that can result in different outcomes, even

though it is repeated in the same manner every time, is called
a random experiment.

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.1 Random
Experiments
PhD. Tri Tuyen Luc Chapter 2. Probability
Definition 1.
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
 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:

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

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:
1
Select a molded plastic part, such as a connector,
and measure its thickness.

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.1 Random
PhD. Tri Tuyen Luc Chapter 2. Probability
Definition 1.
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques

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:
1
Select a molded plastic part, such as a connector,
and measure its thickness.
2
Measure the thickness of two connectors.

PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Experiments
sample spaces) 2.3 Addition Rules

2.1.1 Random Definition 1.

2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
 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:
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.

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.2 Sample
 Spaces 2.1.3 Events
Spaces 2.1.4 Counting Techniques
2.1.1 Random Experiments 2.1.2 Sample

PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Spaces Definition 2.
sample spaces) 2.3 Addition Rules

2.1.2 Sample 2.1.1 Random Experiments 2.1.2 Sample

Spaces 2.1.3 Events
2.1.4 Counting Techniques

The set of all possible outcomes of a random experiment is

called the sample space of the experiment. The sample space
is denoted as S.
 PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Spaces Definition 2.
sample spaces) 2.3 Addition Rules

2.1.2 Sample 2.1.1 Random Experiments 2.1.2 Sample

Spaces 2.1.3 Events
2.1.4 Counting Techniques
 The set of all possible outcomes of a random experiment is
called the sample space of the experiment. The sample space
is denoted as S.
Example 2.1: Measure the thickness of a connector. If
the objective of the analysis is

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 2.

The set of all possible outcomes of a random experiment is

called the sample space of the experiment. The sample space
is denoted as S.
Example 2.1: Measure the thickness of a connector. If
the objective of the analysis is
the thickness: S = R+ = {x|x > 0}.
 PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Spaces Definition 2.
sample spaces) 2.3 Addition Rules

2.1.2 Sample 2.1.1 Random Experiments 2.1.2 Sample

Spaces 2.1.3 Events
2.1.4 Counting Techniques

The set of all possible outcomes of a random experiment is

called the sample space of the experiment. The sample space
is denoted as S.
 Example 2.1: Measure the thickness of a connector. If
the objective of the analysis is
the thickness: S = R+ = {x|x > 0}.
whether a particular part is low, medium, or high
for thickness: S = {low, medium, high}.

PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Spaces Definition 2.
sample spaces) 2.3 Addition Rules

2.1.2 Sample 2.1.1 Random Experiments 2.1.2 Sample

Spaces 2.1.3 Events
2.1.4 Counting Techniques
 The set of all possible outcomes of a random experiment is
called the sample space of the experiment. The sample space
is denoted as S.
Example 2.1: Measure the thickness of a connector. If
the objective of the analysis is
the thickness: S = R+ = {x|x > 0}.
whether a particular part is low, medium, or high
for thickness: S = {low, medium, high}.
whether or not a particular part conforms to the
manufacturing specifications: S = {yes, no}.

PhD. Tri Tuyen Luc Chapter 2. Probability

sample spaces) 2.3 Addition Rules
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.2 Sample 2.1.4 Counting Techniques

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.

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.
 PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete Spaces Definition 3.
sample spaces) 2.3 Addition Rules

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.

In Example 2.1, the choice S = R+ = {x|x > 0} is an example of

a continuous sample space, whereas S = {yes, no} is a
discrete sample space.

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.2 Sample
 Spaces 2.1.3 Events
Spaces 2.1.4 Counting Techniques
2.1.1 Random Experiments 2.1.2 Sample

PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events the sample size is?
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 How “large”

 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
 the sample size is?
2.1.2 Sample
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
Spaces How “large”
Example 2.2: Consider the Example 2.0 (3)
 in section 2.1.1. PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete Spaces How “large”
sample spaces) 2.3 Addition Rules

the sample size is?

2.1.2 Sample
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
 Example 2.2: Consider the Example 2.0 (3) in section 2.1.1.

The sample space contains 48 outcomes.

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

PhD. Tri Tuyen Luc Chapter 2. Probability

2.2 Interpretations of Probability (discrete
2.1 Sample Spaces and Events
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.3 Events

Definition 4.
An event is a subset of the sample space of
a random experiment. PhD. Tri Tuyen Luc Chapter 2.
 Probability

2.1.1 Random Experiments 2.1.2 Sample

2.1 Sample Spaces and Events
Spaces 2.1.3 Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules 2.1.4 Counting Techniques

2.1.3 Events

Definition 4.

An event is a subset of the sample space of a random

 experiment. The union of two events: E1 ∪ E2.

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.4 Counting Techniques

2.1.3 Events

Definition 4.
 An event is a subset of the sample space of a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.

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
Spaces 2.1.3 Events
2.1.4 Counting Techniques
Definition 4.

An event is a subset of the sample space of a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.
The complement of an event: E′ = S \ E (EC in other
literature). Note: (E′)′ = E.

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques

2.1.3 Events

Definition 4.

An event is a subset of the sample space of a random experiment.

 The union of two events: E1 ∪ E2.
The intersection of two events: E1 ∩ E2.
The complement of an event: E′ = S \ E (EC in other
literature). Note: (E′)′ = E.
Example 2.3: Consider the sample space S = {yy, yn, ny, nn}
of measuring two molded plastic parts.

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.4 Counting Techniques

2.1.3 Events

Definition 4.
 An event is a subset of the sample space of a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.
The complement of an event: E′ = S \ E (EC in other
literature). Note: (E′)′ = E.
Example 2.3: Consider the sample space S = {yy, yn, ny, nn}
of measuring two molded plastic parts.
E1=“At least one part conforms”= {yn, ny, yy};

PhD. Tri Tuyen Luc Chapter 2. Probability

sample spaces) 2.3 Addition Rules
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.3 Events 2.1.4 Counting Techniques

Definition 4.

An event is a subset of the sample space of a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.
The complement of an event: E′ = S \ E (EC in other
literature). Note: (E′)′ = E.
Example 2.3: Consider the sample space S = {yy, yn, ny, nn}
of measuring two molded plastic parts.
E1=“At least one part conforms”= {yn, ny, yy};
E2=“both parts do not conform”= {nn} ⇒ E2 = E′1

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques

2.1.3 Events

Definition 4.

An event is a subset of the sample space of

a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.
 The complement of an event: E′ = S \ E (EC
in other literature). Note: (E′)′ = E.
Example 2.3: Consider the sample space S = {yy,
yn, ny, nn} of measuring two molded plastic
parts.
E1=“At least one part conforms”= {yn, ny, yy};
E2=“both parts do not conform”= {nn} ⇒ E2 = E′1
E3=“At least one part does not conform”={yn, ny,

nn}. PhD. Tri Tuyen Luc Chapter 2. Probability

2.1.1 Random Experiments 2.1.2 Sample

2.1 Sample Spaces and Events
Spaces 2.1.3 Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules 2.1.4 Counting Techniques

2.1.3 Events

Definition 4.
 An event is a subset of the sample space of a random experiment.

The union of two events: E1 ∪ E2.

The intersection of two events: E1 ∩ E2.
The complement of an event: E′ = S \ E (EC in other
literature). Note: (E′)′ = E.
Example 2.3: Consider the sample space S = {yy, yn, ny, nn}
of measuring two molded plastic parts.
E1=“At least one part conforms”= {yn, ny, yy};
E2=“both parts do not conform”= {nn} ⇒ E2 = E′1
E3=“At least one part does not conform”={yn, ny, nn}.
⇒ E1 ∪ E1 = S; E1 ∩ E2 = ∅; E1 ∩ E3 = {yn, ny}.

PhD. Tri Tuyen Luc Chapter 2. Probability

2.2 Interpretations of Probability (discrete
2.1 Sample Spaces and Events
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.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
Spaces 2.1.3 Events
2.1.4 Counting Techniques

Definition 5.

Two events, denoted as E1 and E2 , such

that E1 ∩ E2 = ∅ are said to be mutually
exclusive.

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
PhD. Tri Tuyen Luc Chapter 2. Probability
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques

2.1.3 Events

Definition 5.
Two events, denoted as E1 and E2 , such that
E1 ∩ E2 = ∅ are said to be mutually exclusive.

The distributive law for set operations:

(A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C) and (A ∩ B) ∪
 C = (A ∪ C) ∩ (B ∪ C). PhD. Tri Tuyen Luc Chapter 2.

Probability

2.1.1 Random Experiments 2.1.2 Sample

2.1 Sample Spaces and Events
Spaces 2.1.3 Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules 2.1.4 Counting Techniques

2.1.3 Events

Definition 5.
 Two events, denoted as E1 and E2 , such that
E1 ∩ E2 = ∅ are said to be mutually exclusive.

The distributive law for set operations:

(A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C) and (A ∩ B) ∪ C = (A ∪ C) ∩ (B
∪ C). DeMorgan’s laws: (A ∪ B)′ = A′ ∩ B′and (A ∩ B)′ = A′ ∪ B′.

PhD. Tri Tuyen Luc Chapter 2. Probability

sample spaces) 2.3 Addition Rules
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.3 Events 2.1.4 Counting Techniques

Definition 5.

Two events, denoted as E1 and E2 , such that

E1 ∩ E2 = ∅ are said to be mutually exclusive.

The distributive law for set operations:

(A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C) and (A ∩ B) ∪ C = (A ∪ C) ∩ (B
∪ C). DeMorgan’s laws: (A ∪ B)′ = A′ ∩ B′and (A ∩ B)′ = A′ ∪ B′.
 Also, remember that: A ∪ B = B ∪ A and A ∩ B = B ∩ A.

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.4 Counting Techniques

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

We can use Venn diagrams to represent a

sample space and events in a sample space.

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
 Multiplication rule
2.1.4 Counting 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events

Techniques 2.1.4 Counting Techniques

PhD. Tri Tuyen Luc Chapter 2. Probability

sample spaces) 2.3 Addition Rules
2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
 Multiplication rule
2.1.4 Counting 2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events

Techniques 2.1.4 Counting Techniques

Consider the Example 2.0 (3), the sample

size will be:
 2(transitions) × 2(air conds) × 3(stereos) ×

4(colors) = 48 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.1.4 Counting
 Spaces 2.1.3 Events
Techniques 2.1.4 Counting Techniques
2.1.1 Random Experiments 2.1.2 Sample

A Permutation of the elements is an ordered sequence of the

elements. Number of permutations of n different elements:
n! = n × (n − 1) × (n − 2) × · · · × 1.

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

A Permutation of the elements is an ordered sequence of the

elements. Number of permutations of n different elements:
n! = n × (n − 1) × (n − 2) × · · · × 1.
The number of permutations of subsets of r elements selected from a
set of n different elements is
Pnr = n × (n − 1) × · · · × (n − r + 1) = n!

(n − r)!.

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.4 Counting
PhD. Tri Tuyen Luc Chapter 2. Probability
Techniques
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques

A Permutation of the elements is an ordered sequence of the

elements. Number of permutations of n different elements:
n! = n × (n − 1) × (n − 2) × · · · × 1.
The number of permutations of subsets of r elements selected from a
set of n different elements is
 Pnr = n × (n − 1) × · · · × (n − r + 1) = n!

(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!.

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
A Permutation of the elements is an ordered sequence of the
elements. Number of permutations of n different elements:
n! = n × (n − 1) × (n − 2) × · · · × 1.
The number of permutations of subsets of r elements selected from a
set of n different elements is
Pnr = n × (n − 1) × · · · × (n − r + 1) = n!

(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)!

2.1 Sample Spaces and Events
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules
2.1.4 Counting
PhD. Tri Tuyen Luc Chapter 2. Probability
Techniques
2.1.1 Random Experiments 2.1.2 Sample
Spaces 2.1.3 Events
2.1.4 Counting Techniques
 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

A printed circuit board has eight different locations in

which a component can be placed.
 PhD. Tri Tuyen Luc Chapter 2. Probability
2.1 Sample Spaces and Events 2.4:
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules

2.1.1 Random Experiments 2.1.2 Sample

2.1.4 Counting Spaces 2.1.3 Events
2.1.4 Counting Techniques

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.

PhD. Tri Tuyen Luc Chapter 2. Probability

2.2 Interpretations of Probability (discrete
2.1 Sample Spaces and Events
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

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.

PhD. Tri Tuyen Luc Chapter 2. Probability

2.1 Sample Spaces and Events 2.4:
2.2 Interpretations of Probability (discrete
sample spaces) 2.3 Addition Rules

2.1.1 Random Experiments 2.1.2 Sample

2.1.4 Counting Spaces 2.1.3 Events
2.1.4 Counting Techniques

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

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules

2.2 Interpretations of Probability

There are different approaches to assessing the probability

of an uncertain event:
 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

There are different approaches to assessing the probability

of an uncertain event:
 1. A prior classical probability: the probability of an event
is based on prior knowledge of the process involved.

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

There are different approaches to assessing the probability

of an uncertain event:
1. A prior classical probability: the probability of an event
is based on prior knowledge of the process involved.
2. An empirical classical probability or relative frequency:
the probability of an event is based on observed data.

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

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules

2.2 Interpretations of Probability

Equally Likely Outcomes:

Whenever a sample space consists of N possible outcomes

that are equally likely, the probability of each outcome is 1/N.
 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

Equally Likely Outcomes:

Whenever a sample space consists of N

possible outcomes that are equally likely, the
 probability of each outcome is 1/N.

1. A prior classical probability:

X
number of outcomes in S= N.

P(E occurs in an experiment) = number of

outcomes in E 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

Equally Likely Outcomes:

Whenever a sample space consists of N possible outcomes

that are equally likely, the probability of each outcome is 1/N.

1. A prior classical probability:

X
number of outcomes in S= N.

P(E occurs in an experiment) = number of outcomes in E

2. Relative frequency:

P(E occurs in an experiment) = times that E occurs Total times of

random experiments
 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

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules

2.2 Interpretations of Probability

Example 2.5.1: Find the probability of selecting a face card

(Jack, Queen, or King) from a standard deck of 52 cards.
 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

Example 2.5.1: Find the probability of selecting a face card

(Jack, Queen, or King) from a standard deck of 52 cards.
 Solution: Let E=“A face card is selected”, then

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

Example 2.5.1: Find the probability of selecting a face card

(Jack, Queen, or King) from a standard deck of 52 cards.
Solution: Let E=“A face card is selected”, then

P(E) = number of outcomes of E

12 3
number of outcomes of S= 52= 13.

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

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules

2.2 Interpretations of Probability

Example 2.5.2: (Contamination Particles): A visual inspection
of a location on wafers from a semiconductor manufacturing
process.
 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

Example 2.5.2: (Contamination Particles): A visual inspection
of a location on wafers from a semiconductor manufacturing
 process.
Number of Contamination Proportion
Particles of Wafers
0 0.4
1 0.2
2 0.15
3 0.10
4 0.05
≥5 0.10

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

 Example 2.5.2: (Contamination Particles): A visual inspection
of a location on wafers from a semiconductor manufacturing
process.
Number of Contamination Proportion
Particles of Wafers
0 0.4
1 0.2
2 0.15
3 0.10
4 0.05
≥5 0.10
Select randomly a wafer at this location:

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
Example 2.5.2: (Contamination Particles): A visual inspection
of a location on wafers from a semiconductor manufacturing
process.
Number of Contamination Proportion
Particles of Wafers
0 0.4
1 0.2
2 0.15
3 0.10
4 0.05
≥5 0.10
Select randomly a wafer at this location:
The probability that it contains no particles is: 0.4.

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

Example 2.5.2: (Contamination Particles): A visual inspection
of a location on wafers from a semiconductor manufacturing
process.
Number of Contamination Proportion
Particles of Wafers
0 0.4
1 0.2
2 0.15
3 0.10
4 0.05
≥5 0.10
Select randomly a wafer at this location:
The probability that it contains no particles is: 0.4.
The probability that a wafer contains three or more
particles is: 0.10+0.05+0.10=0.25.
 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

2.1 Sample Spaces and Events

2.2 Interpretations of Probability (discrete sample spaces)
2.3 Addition Rules

2.2 Interpretations of Probability

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
 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

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
 (1) P(∅) = 0.

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

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
 (1) P(∅) = 0.
(2) P(S) = 1.

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

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
 (1) P(∅) = 0.
(2) P(S) = 1.
(3) 0 ≤ P(E) ≤ 1.

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

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
(1) P(∅) = 0.
(2) P(S) = 1.
(3) 0 ≤ P(E) ≤ 1.
(4) P(E) = 1 − P(E′).

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

Axioms of Probability: Probability is a

number that is assigned to each member of
a collection of events from a random
 experiment that satisfies the following
properties:
If S is the sample space and E is any event
in a random experiment,
(1) P(∅) = 0.
(2) P(S) = 1.
(3) 0 ≤ P(E) ≤ 1.
(4) P(E) = 1 − P(E′).
(5) P(E1 ∪ E2) = P(E1) + P(E2) for all events

E1 ∩ E2 = ∅. 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

Axioms of Probability: Probability is a number that is assigned

to each member of a collection of events from a random
experiment that satisfies the following properties:
If S is the sample space and E is any event in a
random experiment,
(1) P(∅) = 0.
(2) P(S) = 1.
(3) 0 ≤ P(E) ≤ 1.
(4) P(E) = 1 − P(E′).
(5) P(E1 ∪ E2) = P(E1) + P(E2) for all events E1 ∩ E2 = ∅.
(6) E1 ⊂ E2 ⇒ P(E1) ≤ P(E2).

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.3 Addition Rules

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.3 Addition Rules

Probability of a Union

P(A ∪ B) = P(A) + P(B) − P(A ∩ B) (1)

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.3 Addition Rules

Probability of a Union

P(A ∪ B) = P(A) + P(B) − P(A ∩ B) (1)

If A and B are mutually exclusive events,

P(A ∪ B) = P(A) + P(B) (2)

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.3 Addition Rules

Probability of a Union

P(A ∪ B) = P(A) + P(B) − P(A ∩ B) (1)

If A and B are mutually exclusive events,

P(A ∪ B) = P(A) + P(B) (2)

Probability of a Union of more events

P(A ∪ B ∪ C) = P(A) + P(B) + P(C) − P(A ∩ B)

− P(B ∩ C) − P(C ∩ A) + P(A ∩ B ∩ C) (3)

PhD. Tri Tuyen Luc Chapter 2. Probability