Basic Probability: Dr. K. M. Salah Uddin
Basic Probability: Dr. K. M. Salah Uddin
3. subjective probability
an individual judgment or opinion about the probability of occurrence
Sample Space
The Sample Space is the collection of all
possible events
e.g. All 6 faces of a die:
Black 2 24 26
Red 2 24 26
Total 4 48 52
Tree Diagrams Sample
Ace 2 Space
Sample
C ar d
Space
Bla ck 24
Full Deck No t a n A c e
of 52 Cards Ac e
Red C 2
ard
Not an 24
Ace
Visualizing Events
Venn Diagrams
Let A = aces
Let B = red cards A ∩ B = ace and red
B
A U B = ace or red
Mutually Exclusive Events
Mutually exclusive events
Events that cannot occur together
example:
example:
A = aces; B = black cards;
C = diamonds; D = hearts
Events A, B, C and D are collectively exhaustive
(but not mutually exclusive – an ace may also be
a heart)
Events B, C and D are collectively exhaustive and
also mutually exclusive
Probability
Probability is the numerical measure
of the likelihood that an event will 1 Certain
occur
The probability of any event must be
between 0 and 1, inclusively
0 ≤ P(A) ≤ 1 For any event A 0.5
The sum of the probabilities of all
mutually exclusive and collectively
exhaustive events is 1
P(A) P(B) P(C) 1
0 Impossible
If A, B, and C are mutually exclusive and
collectively exhaustive
Computing Joint and
Marginal Probabilities
Color
Type Red Black Total
Ace 2 2 4
Non-Ace 24 24 48
Total 26 26 52
Marginal Probability Example
P(Ace)
2 2 4
P( Ace and Re d) P( Ace and Black )
52 52 52
Color
Type Red Black Total
Ace 2 2 4
Non-Ace 24 24 48
Total 26 26 52
General Addition Rule
CD No CD Total
AC 0.2 0.5 0.7
No AC 0.2 0.1 0.3
Total 0.4 0.6 1.0
P(A | B) P(A)
Events A and B are independent when the probability
of one event is not affected by the other event
Multiplication Rules
P(A | B i )P(Bi )
P(B i | A)
P(A | B 1)P(B1) P(A | B 2 )P(B 2 ) P(A | B k )P(Bk )
where:
Bi = ith event of k mutually exclusive and collectively
exhaustive events
A = new event that might impact P(Bi)
Bayes’ Theorem Example
Sum = 0.36
Suppose that Mr. Zafar becomes sick in the middle of
the night and asks his sleepy wife to get some drug for
him from the medicine cabinet. Two kinds of tablets are
available T1 and T2. There are only four bottles in the
cabinet; three bottles contain T1, and one bottles
contains T2. If T1 is taken, there is a 90 percent chance
of dizziness, but if T2 is taken, the probability of
dizziness is only 10 percent. Infuriated by being
awakened from a sound sleep, Mr. Zafar’s wife grabs
some tablets and hands them to her husband without
actually knowing whether they are T1 or T2. A few
minutes later, Mr. Zafar becomes very dizzy. What is the
probability that the tablet was T1 or T2?
Counting Rules
Counting Rule 1:
If any one of k different mutually exclusive and
collectively exhaustive events can occur on each of
n trials, the number of possible outcomes is equal to
kn
Counting Rules
(continued)
Counting Rule 2:
If there are k1 events on the first trial, k2 events on
the second trial, … and kn events on the nth trial, the
number of possible outcomes is
(k1)(k2)…(kn)
Example:
You want to go to a park, eat at a restaurant, and see a
movie. There are 3 parks, 4 restaurants, and 6 movie
choices. How many different possible combinations are
there?
Answer: (3)(4)(6) = 72 different possibilities
Counting Rules
(continued)
Counting Rule 3:
The number of ways that n items can be arranged in
order is
n! = (n)(n – 1)…(1)
Example:
Your restaurant has five menu choices for lunch. How many
ways can you order them on your menu?
Answer: 5! = (5)(4)(3)(2)(1) = 120 different possibilities
Counting Rules
(continued)
Counting Rule 4:
Permutations: The number of ways of arranging X
objects selected from n objects in order is
n!
n Px
(n X)!
Example:
Your restaurant has five menu choices, and three are
selected for daily specials. How many different ways can
the specials menu be ordered?
n! 5! 120
nPx 60
(n X)! (5 3)! 2
Answer: different possibilities
Counting Rules
(continued)
Counting Rule 5:
Combinations: The number of ways of selecting X
objects from n objects, irrespective of order, is
n!
n Cx
X!(n X)!
Example:
Your restaurant has five menu choices, and three are
selected for daily specials. How many different special
combinations are there, ignoring the order in which they are
selected?
n! 5! 120
n Cx 10
X!(n X)! 3!(5 3)! (6)(2)
Answer: different possibilities