| Problem Set |
Section |
Problems |
|---|---|---|
| 01 | [*] | Look over the course webpage. In particular, read through the course syllabus, get accustomed to requesting a course calendar, and look over the interface for getting homework assignments. (Notice that there are links directly to assigned problems on the calendar as well, though all assignments beyond PS1 are subject to change at this point.) |
| ** | Read Section 1.1 (pp. 3-12) in your textbook. (Ponder any of the eight problems posed there that you like, but don't read on into later sections for any of the hints or solutions.) Focus on Problem 7: “Let's Make a Deal.” One can simulate this scene by taking three cards from a regular deck, two that are red (representing the mules), and one that is black (the car). Mixed up and placed face down, they represent the three doors behind which the “prizes” await. Get a friend to play this game with you 20 times. Ask the friend to shuffle the cards each time and place them face down so that only she (your friend) knows where the black card is. If you aren't sure you understand how the game is played, play it a couple of times at the website http://www.stat.sc.edu/~west/javahtml/LetsMakeaDeal.html The first 10 times you play with your friend, adopt this strategy: When offered the chance to change doors/cards, stick with your original choice. Count the number of times you win (i.e., get the black card). The last 10 times you play, employ the strategy of changing cards when allowed to do so. Be prepared on Wed. to give the number of times out of 10 you won for each strategy. |
|
| {***} | Please email me your answers to the questions found here at this link. | |
| n | manditory problem |
| (n) | helper problem |
| [n] | ungraded problem |
| {n} | optional problem |