September1999 CMSC 203 / 0201 Fall 2002 Week #9 – 21/23/25 October 2002 Prof. Marie desJardins.

Slides:



Advertisements
Similar presentations
Discrete Probability Chapter 7.
Advertisements

Chapter 12 Probability © 2008 Pearson Addison-Wesley. All rights reserved.
Great Theoretical Ideas in Computer Science.
From Randomness to Probability
March 31, 2015Applied Discrete Mathematics Week 8: Advanced Counting 1 Discrete Probability Example I: A die is biased so that the number 3 appears twice.
Learn to estimate probability using theoretical methods.
Exercises (1) 1. In the usual dice experiment, let A, B and C, be the following events: A = {1,7,6} and B = {1,2,7,5} and C = {3,5} Find the following:
Section 7.4 (partially). Section Summary Expected Value Linearity of Expectations Independent Random Variables.
22C:19 Discrete Structures Discrete Probability Fall 2014 Sukumar Ghosh.
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
Discrete Mathematics Lecture 7 More Probability and Counting Harper Langston New York University.
1 Discrete Math CS 280 Prof. Bart Selman Module Probability --- Part a) Introduction.
1 Copyright M.R.K. Krishna Rao 2003 Chapter 5. Discrete Probability Everything you have learned about counting constitutes the basis for computing the.
Discrete Mathematics Lecture 5
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Week 10 - Monday.  What did we talk about last time?  More permutations  Addition rule  Inclusion and exclusion.
Chapter 9 Introducing Probability - A bridge from Descriptive Statistics to Inferential Statistics.
September1999 CMSC 203 / 0201 Fall 2002 Week #11 – 4/6/8 November 2002 Prof. Marie desJardins.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Lecture Discrete Probability. 5.1 Probabilities Important in study of complexity of algorithms. Modeling the uncertain world: information, data.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Week #7 – 7/9/11 October 2002 Prof. Marie desJardins
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
Chapter 7 With Question/Answer Animations. Section 7.1.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Section 7.2. Section Summary Assigning Probabilities Probabilities of Complements and Unions of Events Conditional Probability Independence Bernoulli.
Discrete Math Lecture 6: Discrete Probability
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
Random Variables. A random variable X is a real valued function defined on the sample space, X : S  R. The set { s  S : X ( s )  [ a, b ] is an event}.
September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins.
Week 11 - Wednesday.  What did we talk about last time?  Exam 2 post-mortem  Combinations.
Chapter 9 Review. 1. Give the probability of each outcome.
1 CHAPTERS 14 AND 15 (Intro Stats – 3 edition) PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.1,
ICS 253: Discrete Structures I Discrete Probability King Fahd University of Petroleum & Minerals Information & Computer Science Department.
QR 32 Section #6 November 03, 2008 TA: Victoria Liublinska
How many different ways can 4 people be seated in a row of 4 seats? Select the correct answer
Probability A quantitative measure of uncertainty A quantitative measure of uncertainty A measure of degree of belief in a particular statement or problem.
Introduction Lecture 25 Section 6.1 Wed, Mar 22, 2006.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Section 7.1. Probability of an Event We first define these key terms: An experiment is a procedure that yields one of a given set of possible outcomes.
3/7/20161 Now it’s time to look at… Discrete Probability.
Counting Techniques (Dr. Monticino). Overview  Why counting?  Counting techniques  Multiplication principle  Permutation  Combination  Examples.
Binomial Distribution. Bernoulli Trials Repeated identical trials are called Bernoulli trials if: 1. There are two possible outcomes for each trial, denoted.
Binomial Probability Theorem In a rainy season, there is 60% chance that it will rain on a particular day. What is the probability that there will exactly.
Basic Probabilities Starting Unit 6 Today!. Definitions  Experiment – any process that generates one or more observable outcomes  Sample Space – set.
Section 7.3. Why we need Bayes?  How to assess the probability that a particular event occurs on the basis of partial evidence.  The probability p(F)
Chapter 7. Section 7.1 Finite probability  In a lottery, players win a large prize when they pick four digits that match, in the correct order, four.
PROBABILITY AND STATISTICS WEEK 2 Onur Doğan. Introduction to Probability The Classical Interpretation of Probability The Frequency Interpretation of.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Now it’s time to look at…
Introduction to Discrete Probability
ICS 253: Discrete Structures I
The Pigeonhole Principle
Chapter 6: Discrete Probability
CS104:Discrete Structures
Conditional Probability
Discrete Probability Chapter 7 With Question/Answer Animations
PROBABILITY AND STATISTICS
Now it’s time to look at…
Discrete Mathematical Structures CS 23022
Now it’s time to look at…
Now it’s time to look at…
Probability of two events
CSE 321 Discrete Structures
Agenda Lecture Content: Discrete Probability
Lecture 2 Basic Concepts on Probability (Section 0.2)
Chapter 11 Probability.
Presentation transcript:

September1999 CMSC 203 / 0201 Fall 2002 Week #9 – 21/23/25 October 2002 Prof. Marie desJardins

September1999 October 1999 TOPICS  Permutations  Combinations  Binomial theorem  Discrete probability  Probability theory

September1999 MON 10/21 PERMUTATIONS AND COMBINATIONS (4.3)

September1999 October 1999 Concepts/Vocabulary  Permutation, r-permutation  P(n, r) = n! / (n-r)!  r-combination  C(n, r) = (n choose r) = n! / (r! (n-r)!)  Pascal’s identity  (n+1 choose k) = (n choose k-1) + (n choose k)  Pascal’s triangle  Binomial theorem  (x+y) n =  j=0 n (n choose j) x n-j y j

September1999 October 1999 Examples  Exercise 4.3.1: List all the permutations of {a,b,c}.  Exercise 4.3.2: How many permutations are there of the set {a,b,c,d,e,f,g}?  How many permutations of a set of size k?  Exercise 4.3.3: How many permutations of {a,b,c,d,e,f,g} end with a?

September1999 October 1999 Examples II  Exercise : A club has 25 members.  (a) How many ways are there to choose four members of the club to serve on an executive committee?  HINT: Which individual is in each of the four positions doesn’t matter  (b) How many ways are there to choose a president, vice president, secretary, and treasurer of the club?  HINT: Which individual is in each of the four positions does matter  Proof of binomial theorem (page 256)

September1999 WED 10/23 DISCRETE PROBABILITY (4.4) ** HOMEWORK #6 DUE ** ** UNGRADED QUIZ TODAY!**

September1999 October 1999 Concepts / Vocabulary  Experiment, sample space, event  Laplace’s probability – p(E) = |E| / |S|  OK for finitely many equally likely outcomes  p(~E) = 1 – P(E)  p(E 1  E 2 ) = p(E 1 ) + p(E 2 ) when E 1, E 2 are disjoint

September1999 October 1999 Examples  Exercise : A roulette wheel has 38 numbers (18 red, 18 black, and 0 and 00, which are neither black or red). The probability that when the wheel is spun it lands on any particular number is 1/38. What is the probability that the wheel …  (a) …lands on a red number?  (b) … lands on a black number twice in a row?  (c) … lands on 0 or 00?  (d) … does not land on 0 or 00 five times in a row?  (e) … lands on a number between 1 and 6, inclusive, on one spin, but does not land between them on the next spin?

September1999 October 1999 Examples II  Example (an apparent paradox): You choose what’s behind Door #1. Before showing you what’s there, the host tells you that Door #2 is a losing door. Should you stick with Door #1 or switch with Door #3?  A door is a door is a door, isn’t it…? Shouldn’t the probability that the prize is behind Door #1 and the probability that the prize is behind Door #3 both be ½, since there are two doors left? (Exercise )  Why does telling you something about Door #2 tell you anything about Door #3??

September1999 October 1999 Examples III  Exercise : Two events E 1 and E 2 are called independent if p(E 1  E 2 ) = p(E 1 ) p(E 2 ). If a coin is tossed three times, which of the following pairs of events are independent:  (a) E 1 : the first coin comes up tails; E 2 : the second coin comes up heads.  (b) E 1 : the first coin comes up tails; E 2 : two, but not three, heads come up in a row.  (c) E 1 : the second coin comes up tails; E 2 : two, and not three, heads come up in a row.

September1999 FRI 10/11 - MON 10/14 PROBABILITY THEORY (4.5)

September1999 October 1999 Concepts and Vocabulary  Axioms of probability: for a set of mutually exclusive outcomes s  S,  0  p(s)  1  s  S p(s) = 1  Event: set of outcomes  Conditional probability p(E|F) = p(E  F) / p(F)  Independence p(E  F) = p(E) p(F), or p(E|F) = p(E)  Bernoulli trials (2 outcomes)  Binomial distribution b(k:n, p) = (n choose k) p k q n-k  Random variables, expected values  Independent random variables, variance

September1999 October 1999 Examples  Dice rolling:  Find the probability of each outcome when a biased die is rolled, if rolling a 2 or 4 are each three times as likely as rolling each of the other four numbers on the die.  What is the probability of rolling a 7 with two ordinary dice?  Exercise 4.5.5: Suppose a pair of dice is loaded. The probability that a 4 appears on the first die is 2/7 (other outcomes are 1/7), and the probability that a 3 appears on the second die is 2/7 (other outcomes are 1/7). What is the probability of rolling a 7 with these two dice?

September1999 October 1999 Examples II  Independence  Exercise : Show that if E and F are independent events, then ~E and ~F are also independent events.  Exercise : If E and F are independent events, prove or disprove that ~E and F are necessarily independent events.  Conditional probability  Exercise : What is the conditional probability that exactly four heads apppear when a fair coin is flipped five times, given that the first flip came up heads?  Exercise : What is the c.p. that a random bit string of length 4 contains at lest 2 consecutive 0s, given that the first bit is a 1?

September1999 October 1999 Examples III  Bernoulli trials: Exercise : Find each of the following probabilities when n independent Bernoulli trials are carried out with probability of success p.  (a) the probability of no successes  (b) the probability of at least one success  (c) the probability of at most one success  (d) the probability of at least two successes

September1999 October 1999 Examples IV  Random variables and expected values:  Exercise : What is the expected sum of the numbers that appear on two dice, each biased so that a 3 comes up twice as often as each other number?  Exercise : What is the expected value of a $1 lottery ticket when the purchaser wins $10,000,000 iff the ticket contains the six winning numbers chosen from the set {1,2,3,…,50} (and nothing otherwise)?  Exercise : The 203 final exam contains 50 T/F questions (2 points each) and 25 multiple-choice questions (4 points each).  Linda answers a T/F question correctly with probability.9, and a multiple-choice question with probability.8. What is her expected score on the final?  What is the expected score of Emily, who hasn’t studied at all and answers T/F questions correctly with probability.5, and multiple-choice questions correctly with probability.25?