(→Problem 3: Internet Outage) |
|||
| (37 intermediate revisions by 20 users not shown) | |||
| Line 1: | Line 1: | ||
| + | [[Category:ECE302Fall2008_ProfSanghavi]] | ||
| + | [[Category:probabilities]] | ||
| + | [[Category:ECE302]] | ||
| + | [[Category:homework]] | ||
| + | [[Category:problem solving]] | ||
| + | |||
== Instructions == | == Instructions == | ||
Homework 3 can be [https://engineering.purdue.edu/ece302/homeworks/HW3FA08.pdf downloaded here] on the [https://engineering.purdue.edu/ece302/ ECE 302 course website]. | Homework 3 can be [https://engineering.purdue.edu/ece302/homeworks/HW3FA08.pdf downloaded here] on the [https://engineering.purdue.edu/ece302/ ECE 302 course website]. | ||
| Line 6: | Line 12: | ||
http://nostalgia.wikipedia.org/wiki/Monty_Hall_problem | http://nostalgia.wikipedia.org/wiki/Monty_Hall_problem | ||
Explains the original Monty Hall problem and then the problem considering two contestants are involved. | Explains the original Monty Hall problem and then the problem considering two contestants are involved. | ||
| + | |||
| + | Consider the following twist on the monty hall problem (see video above to recollect): | ||
| + | |||
| + | There are 3 doors, behind one of which there is a car, and the remaining two have goats. You and a friend each pick a door. One of you will have definitely picked a goat. The host then opens one of the two chosen doors (i.e. yours or your friend's), shows a goat and kicks that person out (if both of you have chosen goats, he opens one door at random). The other person is given the option of staying put, or switching to the one remaining door. | ||
| + | |||
| + | *(a) When originally picking your doors, should you choose your door first, or let your friend go first? Does it make a difference? | ||
[[HW3.1.a Zhongtian Wang_ECE302Fall2008sanghavi]] | [[HW3.1.a Zhongtian Wang_ECE302Fall2008sanghavi]] | ||
[[HW3.1.a Shao-Fu Shih_ECE302Fall2008sanghavi]] | [[HW3.1.a Shao-Fu Shih_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.1.a Michael Allen_ECE302Fall2008sanghavi]] | ||
[[HW3.1.a Beau "ballah-fo-life" Morrison_ECE302Fall2008sanghavi]] | [[HW3.1.a Beau "ballah-fo-life" Morrison_ECE302Fall2008sanghavi]] | ||
[[HW3.1.a Suan-Aik Yeo_ECE302Fall2008sanghavi]] | [[HW3.1.a Suan-Aik Yeo_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.1.a Chris Wacnik_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.1.a Chris Cadwallader_ECE302Fall2008sanghavi]] | ||
[[HW3.1.a Dan Van Cleve_ECE302Fall2008sanghavi]] | [[HW3.1.a Dan Van Cleve_ECE302Fall2008sanghavi]] | ||
[[HW3.1.a Joe Gutierrez_ECE302Fall2008sanghavi]] | [[HW3.1.a Joe Gutierrez_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | *(b) It turns out that the host has just eliminated your friend. What should you do? (i.e. stick with your original door, or switch?) What are the probabilities of winning in each case? | ||
[[HW3.1.b Zhongtian Wang & Jonathan Morales_ECE302Fall2008sanghavi]] | [[HW3.1.b Zhongtian Wang & Jonathan Morales_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW 3.1b Albert Lai_ECE302Fall2008sanghavi]] | ||
[[HW3.1.b Spencer Mitchell_ECE302Fall2008sanghavi]] | [[HW3.1.b Spencer Mitchell_ECE302Fall2008sanghavi]] | ||
| Line 29: | Line 51: | ||
[[HW 3.1b Ben Wurtz_ECE302Fall2008sanghavi]] | [[HW 3.1b Ben Wurtz_ECE302Fall2008sanghavi]] | ||
| − | + | [[HW 3.1b Vivek Ravi_ECE302Fall2008sanghavi]] | |
| + | |||
[[HW3.1.b Anand Gautam_ECE302Fall2008sanghavi]] | [[HW3.1.b Anand Gautam_ECE302Fall2008sanghavi]] | ||
| − | |||
[[HW3.1.b Steve Streeter_ECE302Fall2008sanghavi]] | [[HW3.1.b Steve Streeter_ECE302Fall2008sanghavi]] | ||
| − | |||
[[HW3.1.b Kushagra Kapoor_ECE302Fall2008sanghavi]] | [[HW3.1.b Kushagra Kapoor_ECE302Fall2008sanghavi]] | ||
| − | |||
| − | + | [[HW3.1.b Anthony O'Brien_ECE302Fall2008sanghavi]] | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | [[HW3.1.b Seraj Dosenbach_ECE302Fall2008sanghavi]] | |
| − | [[HW3.1.b | + | [[HW3.1b Priyanka Savkar_ECE302Fall2008sanghavi]] |
| + | |||
| + | [[HW3.1.b Emily Blount_ECE302Fall2008sanghavi]] | ||
== Problem 2: A Bayesian Proof == | == Problem 2: A Bayesian Proof == | ||
| + | The theorem of total probability states that <math>P(A) = P(A|C)P(C) + P(A|C^c)P(C^c)</math>. Show that this result still holds when everything is conditioned on event <math>B</math>, that is, prove that | ||
| + | |||
| + | <math>P(A|B) = P(A|B\cap C)P(C|B) + P(A|B\cap C^c)P(C^c|B).</math> | ||
| + | |||
| + | |||
[[HW3.2 - Steve Anderson_ECE302Fall2008sanghavi]] | [[HW3.2 - Steve Anderson_ECE302Fall2008sanghavi]] | ||
| Line 60: | Line 80: | ||
[[HW3.2 Emir Kavurmacioglu_ECE302Fall2008sanghavi]] | [[HW3.2 Emir Kavurmacioglu_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.2 Phil Cannon_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.2 Sourabh Ranka_ECE302Fall2008sanghavi]] | ||
== Problem 3: Internet Outage == | == Problem 3: Internet Outage == | ||
| + | A certain Internet service provider in a midsize city relies on <math>k</math> separate connections between the city and neighboring cities, to connect its customers to the Internet. Based on past experience, management assumes that a given connection will be down on a given day with probability <math>p = 0.001</math>, independently of what happens on other days or with other connections. Total outage is said to occur if all connections are down on the same day. How large should <math>k</math> be so that the probability total outage occurs at least one day in a year is less than or equal to 0.001? | ||
| + | |||
[[HW3.3 Gregory Pajot_ECE302Fall2008sanghavi]] | [[HW3.3 Gregory Pajot_ECE302Fall2008sanghavi]] | ||
| Line 72: | Line 98: | ||
[[HW3.3 Jayanth Athreya_ECE302Fall2008sanghavi]] | [[HW3.3 Jayanth Athreya_ECE302Fall2008sanghavi]] | ||
| + | [[HW3.3 Steven Millies_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.3 Carlos Leon_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[HW3.3 Ken Pesyna_ECE302Fall2008sanghavi]] | ||
== Problem 4: Colored Die== | == Problem 4: Colored Die== | ||
| + | There are three dice in a bag. One has one red face, another has two red faces, and the third has three red faces. One of the dice is drawn at random from the bag, each die having an equal chance of being drawn. The selected die is repeatedly rolled. | ||
| + | |||
| + | *(a) What is the probability that red comes up on the first roll? | ||
[[HW3.4.a Seraj Dosenbach_ECE302Fall2008sanghavi]] | [[HW3.4.a Seraj Dosenbach_ECE302Fall2008sanghavi]] | ||
| Line 81: | Line 115: | ||
[[HW3.4.a Eric Zarowny_ECE302Fall2008sanghavi]] | [[HW3.4.a Eric Zarowny_ECE302Fall2008sanghavi]] | ||
| − | HW3. | + | [[HW3.4.a Anand Gautam_ECE302Fall2008sanghavi]] |
| + | |||
| + | [[HW3.4a Jaewoo Choi_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | *(b) Given that red comes up on the first roll, what is the conditional probability that red comes up on the second roll? | ||
[[HW3.4.b Joon Young Kim_ECE302Fall2008sanghavi]] | [[HW3.4.b Joon Young Kim_ECE302Fall2008sanghavi]] | ||
| Line 87: | Line 125: | ||
[[HW3.4.b Jared McNealis_ECE302Fall2008sanghavi]] | [[HW3.4.b Jared McNealis_ECE302Fall2008sanghavi]] | ||
| − | [ | + | [[HW3.4.b Seraj Dosenbach_ECE302Fall2008sanghavi]] |
| − | + | ||
| − | + | *(c) Given that red comes up on the first three rolls, what is the conditional probability that the selected die has red on three faces? | |
| − | + | ||
| − | + | [[HW 3.4.c Junzhe Geng_ECE302Fall2008sanghavi]] | |
| − | + | ||
| − | + | ||
| − | + | ||
[[HW3.4 Aishwar Sabesan _ECE302Fall2008sanghavi]] | [[HW3.4 Aishwar Sabesan _ECE302Fall2008sanghavi]] | ||
| Line 100: | Line 135: | ||
[[HW3.4c AJ Hartnett_ECE302Fall2008sanghavi]] | [[HW3.4c AJ Hartnett_ECE302Fall2008sanghavi]] | ||
| − | [[HW3. | + | [[HW3.4c Patrick M. Avery Jr._ECE302Fall2008sanghavi]] |
== Problem 5: Fuzzy Logic == | == Problem 5: Fuzzy Logic == | ||
| + | As we saw in class, two random bits are independent if knowing the value of one does not change your beliefs about the other. We saw that if <math>A</math> and <math>B</math> are independent and each is equally likely to be 0 or 1, then <math>A</math> XOR <math>B</math> is independent of <math>A</math>. Is the same true if the bits are biased, with the probability of being 1 equal to <math>p</math>? | ||
| + | |||
| + | [[3.5 - Nicholas Browdues_ECE302Fall2008sanghavi]] | ||
| + | |||
[[3.5 - Divyanshu Kamboj_ECE302Fall2008sanghavi]] | [[3.5 - Divyanshu Kamboj_ECE302Fall2008sanghavi]] | ||
| Line 110: | Line 149: | ||
[[3.5 - Brian Thomas_ECE302Fall2008sanghavi]] | [[3.5 - Brian Thomas_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | [[3.5 - Justin Mauck_ECE302Fall2008sanghavi]] | ||
| + | |||
| + | == Extras == | ||
| + | |||
| + | [[Monty Hall in Action - Henry Michl_ECE302Fall2008sanghavi]] | ||
| + | ---- | ||
| + | [[Main_Page_ECE302Fall2008sanghavi|Back to ECE302 Fall 2008 Prof. Sanghavi]] | ||
Latest revision as of 11:55, 22 November 2011
Contents
Instructions
Homework 3 can be downloaded here on the ECE 302 course website.
Problem 1: Monte Hall, twisted
http://nostalgia.wikipedia.org/wiki/Monty_Hall_problem Explains the original Monty Hall problem and then the problem considering two contestants are involved.
Consider the following twist on the monty hall problem (see video above to recollect):
There are 3 doors, behind one of which there is a car, and the remaining two have goats. You and a friend each pick a door. One of you will have definitely picked a goat. The host then opens one of the two chosen doors (i.e. yours or your friend's), shows a goat and kicks that person out (if both of you have chosen goats, he opens one door at random). The other person is given the option of staying put, or switching to the one remaining door.
- (a) When originally picking your doors, should you choose your door first, or let your friend go first? Does it make a difference?
HW3.1.a Zhongtian Wang_ECE302Fall2008sanghavi
HW3.1.a Shao-Fu Shih_ECE302Fall2008sanghavi
HW3.1.a Michael Allen_ECE302Fall2008sanghavi
HW3.1.a Beau "ballah-fo-life" Morrison_ECE302Fall2008sanghavi
HW3.1.a Suan-Aik Yeo_ECE302Fall2008sanghavi
HW3.1.a Chris Wacnik_ECE302Fall2008sanghavi
HW3.1.a Chris Cadwallader_ECE302Fall2008sanghavi
HW3.1.a Dan Van Cleve_ECE302Fall2008sanghavi
HW3.1.a Joe Gutierrez_ECE302Fall2008sanghavi
- (b) It turns out that the host has just eliminated your friend. What should you do? (i.e. stick with your original door, or switch?) What are the probabilities of winning in each case?
HW3.1.b Zhongtian Wang & Jonathan Morales_ECE302Fall2008sanghavi
HW 3.1b Albert Lai_ECE302Fall2008sanghavi
HW3.1.b Spencer Mitchell_ECE302Fall2008sanghavi
HW 3.1b Sahil Khosla_ECE302Fall2008sanghavi
HW 3.1b Virgil Hsieh_ECE302Fall2008sanghavi
HW 3.1b Ben Wurtz_ECE302Fall2008sanghavi
HW 3.1b Vivek Ravi_ECE302Fall2008sanghavi
HW3.1.b Anand Gautam_ECE302Fall2008sanghavi
HW3.1.b Steve Streeter_ECE302Fall2008sanghavi
HW3.1.b Kushagra Kapoor_ECE302Fall2008sanghavi
HW3.1.b Anthony O'Brien_ECE302Fall2008sanghavi
HW3.1.b Seraj Dosenbach_ECE302Fall2008sanghavi
HW3.1b Priyanka Savkar_ECE302Fall2008sanghavi
HW3.1.b Emily Blount_ECE302Fall2008sanghavi
Problem 2: A Bayesian Proof
The theorem of total probability states that $ P(A) = P(A|C)P(C) + P(A|C^c)P(C^c) $. Show that this result still holds when everything is conditioned on event $ B $, that is, prove that
$ P(A|B) = P(A|B\cap C)P(C|B) + P(A|B\cap C^c)P(C^c|B). $
HW3.2 - Steve Anderson_ECE302Fall2008sanghavi
HW3.2 Tiffany Sukwanto_ECE302Fall2008sanghavi
HW3.2 Sang Mo Je_ECE302Fall2008sanghavi
HW3.2 Emir Kavurmacioglu_ECE302Fall2008sanghavi
HW3.2 Phil Cannon_ECE302Fall2008sanghavi
HW3.2 Sourabh Ranka_ECE302Fall2008sanghavi
Problem 3: Internet Outage
A certain Internet service provider in a midsize city relies on $ k $ separate connections between the city and neighboring cities, to connect its customers to the Internet. Based on past experience, management assumes that a given connection will be down on a given day with probability $ p = 0.001 $, independently of what happens on other days or with other connections. Total outage is said to occur if all connections are down on the same day. How large should $ k $ be so that the probability total outage occurs at least one day in a year is less than or equal to 0.001?
HW3.3 Gregory Pajot_ECE302Fall2008sanghavi
HW3.3 Monsu Mathew_ECE302Fall2008sanghavi
HW3.3 Joe Romine_ECE302Fall2008sanghavi
HW3.3 Katie Pekkarinen_ECE302Fall2008sanghavi
HW3.3 Jayanth Athreya_ECE302Fall2008sanghavi
HW3.3 Steven Millies_ECE302Fall2008sanghavi
HW3.3 Carlos Leon_ECE302Fall2008sanghavi
HW3.3 Ken Pesyna_ECE302Fall2008sanghavi
Problem 4: Colored Die
There are three dice in a bag. One has one red face, another has two red faces, and the third has three red faces. One of the dice is drawn at random from the bag, each die having an equal chance of being drawn. The selected die is repeatedly rolled.
- (a) What is the probability that red comes up on the first roll?
HW3.4.a Seraj Dosenbach_ECE302Fall2008sanghavi
HW3.4.a Shweta Saxena_ECE302Fall2008sanghavi
HW3.4.a Joshua Long_ECE302Fall2008sanghavi
HW3.4.a Eric Zarowny_ECE302Fall2008sanghavi
HW3.4.a Anand Gautam_ECE302Fall2008sanghavi
HW3.4a Jaewoo Choi_ECE302Fall2008sanghavi
- (b) Given that red comes up on the first roll, what is the conditional probability that red comes up on the second roll?
HW3.4.b Joon Young Kim_ECE302Fall2008sanghavi
HW3.4.b Jared McNealis_ECE302Fall2008sanghavi
HW3.4.b Seraj Dosenbach_ECE302Fall2008sanghavi
- (c) Given that red comes up on the first three rolls, what is the conditional probability that the selected die has red on three faces?
HW 3.4.c Junzhe Geng_ECE302Fall2008sanghavi
HW3.4 Aishwar Sabesan _ECE302Fall2008sanghavi
HW3.4c AJ Hartnett_ECE302Fall2008sanghavi
HW3.4c Patrick M. Avery Jr._ECE302Fall2008sanghavi
Problem 5: Fuzzy Logic
As we saw in class, two random bits are independent if knowing the value of one does not change your beliefs about the other. We saw that if $ A $ and $ B $ are independent and each is equally likely to be 0 or 1, then $ A $ XOR $ B $ is independent of $ A $. Is the same true if the bits are biased, with the probability of being 1 equal to $ p $?
3.5 - Nicholas Browdues_ECE302Fall2008sanghavi
3.5 - Divyanshu Kamboj_ECE302Fall2008sanghavi
3.5 - Katie Pekkarinen_ECE302Fall2008sanghavi
3.5 - Caleb Ayew-ew_ECE302Fall2008sanghavi
3.5 - Brian Thomas_ECE302Fall2008sanghavi
3.5 - Justin Mauck_ECE302Fall2008sanghavi
Extras
Monty Hall in Action - Henry Michl_ECE302Fall2008sanghavi
