(→Problem 4: Colored Die) |
|||
| Line 21: | Line 21: | ||
== Problem 2: A Bayesian Proof == | == Problem 2: A Bayesian Proof == | ||
[[HW3.2 - Steve Anderson_ECE302Fall2008sanghavi]] | [[HW3.2 - Steve Anderson_ECE302Fall2008sanghavi]] | ||
| + | [[HW3.2 Tiffany Sukwanto_ECE302Fall2008sanghavi]] | ||
== Problem 3: Internet Outage == | == Problem 3: Internet Outage == | ||
Revision as of 08:03, 15 September 2008
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.
HW3.1.a Shao-Fu Shih_ECE302Fall2008sanghavi
HW3.1.a Beau "ballah-fo-life" Morrison_ECE302Fall2008sanghavi
HW3.1.a Suan-Aik Yeo_ECE302Fall2008sanghavi
HW3.1.b Spencer Mitchell_ECE302Fall2008sanghavi
Problem 1: Monte Hall, twisted
HW3.1.b Anand Gautam_ECE302Fall2008sanghavi This scenario is almost the same like the original problem. Just that your friend is kicked out by the host. The probability of you picking the car if you swap is 2/3 and not swapping is 1/3.
Problem 2: A Bayesian Proof
HW3.2 - Steve Anderson_ECE302Fall2008sanghavi HW3.2 Tiffany Sukwanto_ECE302Fall2008sanghavi
Problem 3: Internet Outage
HW3.3 Gregory Pajot_ECE302Fall2008sanghavi
HW3.3 Monsu Mathew_ECE302Fall2008sanghavi
HW3.3 Joe Romine_ECE302Fall2008sanghavi
Problem 4: Colored Die
HW3.4.a Seraj Dosenbach_ECE302Fall2008sanghavi
HW3.1.b Anand Gautam For part a, the chance of drawing each die is independent of the other one. So the probability of red on the first roll is just the product of the chance of drawing a red face on each die. hope that makes sense.
HW3.4.b Joon Young Kim_ECE302Fall2008sanghavi
