(→Problem 1: Monte Hall, twisted) |
(→Problem 1: Monte Hall, twisted) |
||
| Line 12: | Line 12: | ||
[[HW3.1.b Anand Gautam_ECE302Fall2008sanghavi]] | [[HW3.1.b Anand Gautam_ECE302Fall2008sanghavi]] | ||
| − | + | == Problem 1: Monte Hall, twisted == | |
This scenario is almost the same like the original problem. | This scenario is almost the same like the original problem. | ||
Revision as of 19:29, 13 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.b Spencer Mitchell_ECE302Fall2008sanghavi
HW3.1.b Anand Gautam_ECE302Fall2008sanghavi
Problem 1: Monte Hall, twisted
This scenario is almost the same like the original problem.
Problem 2: A Bayesian Proof
HW3.2 - Steve Anderson_ECE302Fall2008sanghavi
Problem 3: Internet Outage
HW3.3 Gregory Pajot_ECE302Fall2008sanghavi
Problem 4: Colored Die
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.
