Stat 5131 (Geyer) First Midterm Solutions

Stat 5131 (Geyer) First Midterm Solutions - Up: Stat 5131...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Up: Stat 5131 Stat 5131 (Geyer) Midterm 1 Problem 1 This is solved using a two-stage process exactly like we used to calculate the probability of most of the poker hands (full house, three of a kind, two pair, one pair). First we choose which suit gets the four cards. There are ways to do that. The other three suits get three cards, there is no choice remaining about how many cards go to which suit. Second we choose which cards go to each suit. There are ways to choose cards for the suit that gets four cards and ways to choose cards for the other three suits. Thus there are bridge hands with 4-3-3-3 distribution. Since there are possible bridge hands, the answer is (The numerical answer is not necessary for full credit, just the formula). Problem 2 This is a Bayes rule problem. Let A denote the event that the computer has an Acme disk, let B denote the event that the computer has a Barfulous disk, and F denote the event that the disk fails. Then we are given in the problem statement We are asked to calculate P ( A | F ). Bayes rule is
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

Stat 5131 (Geyer) First Midterm Solutions - Up: Stat 5131...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online