CSE312-Assignment 2 Solved

CSE 312: Foundations of Computing II

Assignment #2

Give your answers for this exercise to 3 significant digits.The Schnapsen deck is well shuffled and you are dealt a 5-card hand. What is the probability that you have at least one spade and at least one heart?
All 20 cards are well shuffled again and you are dealt a 5-card hand. What is the probability that you have at least one spade and at least one heart and at least one club?
Final exams are given over a period of 5 days, with 6 time slots per day, so that there are 30 final exam slots in total. You are taking CSE 331, CSE 341, and CSE 351, each with a final exam. Assume that no two of your exams are given on the same day and time, but otherwise each exam is assigned to a randomly chosen day and time slot independently. Give exact answers expressed as simplified fractions.What is the probability that your 3 final exams fall on 3 different days? Use the sample space consisting of ordered triples (x331, x341, x351), where xi is the day and time slot to which the exam for i is assigned.
What is the probability that your 3 final exams fall on 3 different days? Use the sample space consisting of sets {x331, x341, x351} of size 3, where xi is the day and time slot to which the exam for i is assigned.
What is the probability that your 3 final exams all fall on the same day? Use the sample space consisting of ordered triples (x331, x341, x351), where xi is the day and time slot to which the exam for i is assigned.
What is the probability that your 3 final exams all fall on the same day? Use the sample space consisting of sets {x331, x341, x351} of size 3, where xi is the day and time slot to which the exam for i is assigned.
An urn contains 6 red, 7 green, and 8 blue balls. The following is repeated 3 times: a ball is selected from the urn at random and removed (called “sampling without replacement”). Give your answers to 3 significant digits.What is the probability that all 3 selected balls are the same color?
What is the probability that all 3 selected balls are different colors?
Repeat part (a) assuming “sampling with replacement”. That is, the following is repeated 3 times: a single ball is selected from the urn at random, its color is noted, then it is returned to the urn before the next ball is drawn.
Repeat part (b) assuming sampling with 
Suppose you choose 26 random, distinct, odd integers from the set [1,97] (integers from 1 to 97, inclusive), with each odd integer equally likely to be chosen. (“Distinct” means that no two of the chosen integers are equal.) What is the probability that there is a pair of chosen integers that sum to 100? Give an exact answer as a simplified fraction and justify your answer.
Rosencrantz and Guildenstern are flipping coins. Guildenstern has a bag with 50 coins in it. All of them are fair coins, except for 4 that each have heads on both sides and 1 that has tails on both sides. Guildenstern reaches into the bag without looking, removes a randomly chosen coin, with each of the 50 coins equally likely, and flips it. Give exact answers expressed as simplified fractions.What is the probability that it is one of the 2-headed coins, given that the flip came up heads?
What is the probability that it is one of the fair coins, given that the flip came up heads?
What is the probability that it is one of the fair coins, given that the flip came up tails?
Alice, Bob, and Chris, in that order and starting with Alice, take turns drawing a random card from a Schnapsen deck and then returning it to the deck and reshuffling the cards, continuing until either ♥K or ♥Q is drawn. The first one to draw either of these two cards wins.Explain why Ω = {0i1 | i ≥ 0} ∪ {the infinite string 000 · · ·} is a reasonable definition of the sample space of this experiment.
What is the probability of each outcome in the sample space? Show that these probabilities add up to 1, as they must in any proper sample space.
Let A be the event that Alice wins, B be the event that Bob wins, and C be the event that Chris wins. Let N be the event that no one wins, ever. State in which of these four sets each element of Ω belongs and calculate the probability of each of these four events. Give each probability exactly as a simplified fraction.
You are playing a game of Schnapsen with the Maestro and find yourself in this situation:
Your cards

♠ KQ

♥ —

♣ A

♦ AQ
Concealed cards

♠ AT

♥ AKJ

♣ TJ

♦ TKJ
Face-up trump: ♠J

Stock: 5 face-down cards

Game points to win: You 2, Maestro 2

Trick points: You 13, Maestro 27

On lead: You
The Maestro declared the heart marriage earlier and led ♥Q, so you know he is still holding ♥K. Things are looking very good for you. You already have 13 points in your tricks and you are on lead holding the trump marriage (worth 40 trick points) and two aces. You decide that it’s a good time to close the stock. Since the Maestro has fewer than 33 trick points at the time you close the stock, whoever win this deal will receive 2 game points and will win the whole game.

Your plan after closing the stock is to declare the trump marriage, bringing your trick point total to 53, and lead ♠Q. If the Maestro holds only one of ♠AT you will lose this trick, but you are guaranteed to win the next trick and can then lead one of your aces. That will take you well over 66 trick points and you win.

The only danger, in fact, is if the Maestro hold both of ♠AT and also has at least one heart in addition to the ♥K you know he holds. What will happen in this case? He will win your lead of ♠Q with ♠A and will then lead ♠T, forcing you to play your last trump ♠K. Those two tricks will bring his trick point total to 27 + 11 + 3 + 10 + 4 = 55. He will then lead his two winning hearts, one at a time. You will be forced to play one of your aces on his second heart, and the Maestro will have accumulated much more than 66 trick points himself and will win. (If the Maestro has no other heart than ♥K, he can only get to 55 + 4 + 3 = 62 and then has to lead a club or diamond, and you will be the one to reach 66 and win.)

In summary, you will lose the game if and only if the Maestro holds both of ♠AT and at least one heart in addition to ♥K.

Let S be the event that the Maestro holds both ♠AT and let H be the event that the Maestro holds at least one heart in addition to ♥K. The end result of this exercise will be to calculate your probability of losing, which is P(S ∩ H). For all parts, give exact answers as simplified fractions.

Calculate P(S). Don’t forget that you know the Maestro holds ♥
Calculate P(H | S). (Hint: the phrase “at least one heart” should suggest a good technique to use.)
Calculate your probability of losing the game.
For your interest, this deal actually arose a year ago at our Friday Schnapsen Club, with the Maestro playing against one of last year’s 312 students. An interesting feature of the deal is that you have another possible way to play it, which is to lead ♦A first. If you win that trick, you will have at least 13 + 11 + 2 = 26 trick points, and then declaring the trump marriage brings you to at least 66. You could calculate the probability of losing with this alternative line of play by following a very similar outline to this exercise, and then use those two probabilities to decide which of these two plays is better. (You don’t have to do what it says in the previous sentence for this homework, it is just there for your interest.)