DOC PREVIEW
MIT 6 041 - Probabilistic Systems Analysis

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis (Fall 2010) Recitation 2 September 14, 2010 1. Problem 1.15, page 56-57 in the text. A coin is tossed twice. Alice claims that the event of two heads is at least as likely if we know that the first toss is a head than if we know that at least one of the tosses is a head. Is she right? Does it make a difference if the coin is fair or unfair? How can we generalize Alice’s reasoning? 2. Problem 1.14, page 56 in the text. We roll two fair 6-sided dice. Each one of the 36 possible outcomes is assumed to be equally likely. (a) Find the probability that doubles are rolled. (b) Given that the roll results in a sum of 4 or less, find the conditional probability that doubles are rolled. (c) Find the probability that at least one die roll is a 6. (d) Given that the two dice land on different numb ers, find the conditional probability that at least one die roll is a 6. 3. Example 1.13, page 29, and Example 1.17, page 33, in the text. You enter a chess tournament where your probability of winning a game is 0.3 against half of the players (call them type 1), 0.4 against a quarter of the players (call them type 2), and 0.5 against the remaining quarter of the players (call them type 3). You play a game against a randomly chosen opponent. (a) What is the probability of winning? (b) Suppose that you win. What is the probability that you had an opponent of type 1? 4. Example 1.12, page 27 in the text. The Monty Hall Problem. This is a much discussed puzzle, based on an old American game show. You are told that a prize is equally likely to be found behind any one of three closed doors in front of you. You point to one of the doors. A friend opens for you one of the remaining two doors, after making sure that the prize is not behind it. At this point, you can stick to your initial choice, or switch to the other unopened door. You win the prize if it lies behind your final choice of a door. Consider the following strategies: (a) Stick to your initial choice. (b) Switch to the other unopened door. (c) You first point to door 1. If door 2 is opened, you do not switch. If door 3 is op ened, you switch. Which is the best strategy? f 1 Textbook problems are courtesy of Athena Scientific, and are used with permission.Page 1 oMIT OpenCourseWare http://ocw.mit.edu 6.041 / 6.431 Probabilistic Systems Analysis and Applied Probability Fall 2010 For information about citing these materials or our Terms of Use, visit:


View Full Document

MIT 6 041 - Probabilistic Systems Analysis

Documents in this Course
Quiz 1

Quiz 1

5 pages

Quiz 2

Quiz 2

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

2 pages

Syllabus

Syllabus

11 pages

Quiz 2

Quiz 2

7 pages

Quiz 1

Quiz 1

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

13 pages

Quiz 1

Quiz 1

13 pages

Load more
Download Probabilistic Systems Analysis
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Probabilistic Systems Analysis and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Probabilistic Systems Analysis 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?