Recall the airplane puzzle from the lab: the first person to get on the plane picks a random seat, the rest sit in their assigned seat if it is available, otherwise pick a random available seat. Assume person i is assigned the seat i.
Suppose person 18 came in and discovered that their seat is taken. Assuming that the last person's seat, which is seat number n=32 on this plane, it is still available, what is the probability that person 18 will randomly pick it? Hint: to make sure your formula is correct, check that it works for the passenger right before the last one.
Enter your answer as a decimal number with at most three digits after the decimal point, rounding if necessary. For example, if your answer is 1/3, round it and enter it as 0.333, if your answer is 2/3, enter it as 0.667, and if your answer is 1/2, enter it as 0.5.
Your Answer:
Step by stepSolved in 2 steps with 4 images
- Pick one million sets of 12 uniform random numbers between 0 and 1. Sum up the 12 numbers in each set. Make a histogram with these one million sums, picking some reasonable binning. You will find that the mean is (obviously?) 12 times 0.5 = 6. Perhaps more surprising, you will find that the distribution of these sums looks very much Gaussian (a "Bell Curve"). This is an example of the "Central Limit Theorem", which says that the distribution of the sum of many random variables approaches the Gaussian distribution even when the individual variables are not gaussianly distributed. mean Superimpose on the histogram an appropriately normalized Gaussian distribution of 6 and standard deviation o = 1. (Look at the solutions from the week 5 discussion session for some help, if you need it). You will find that this Gaussian works pretty well. Not for credit but for thinking: why o = 1 in this case? (An explanation will come once the solutions are posted).arrow_forwardThere are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan. c++arrow_forwardThere are 22 gloves in a drawer: 5 pairs of red gloves, 4 pairs of yellow, and 2 pairs of green. You select the gloves in the dark and can check them only after a selection has been made. What is the smallest number of gloves you need to select to have at least one matching pair in the best case? in the worst case?arrow_forward
- There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan.arrow_forwardX-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution. You…arrow_forwardno handwritten Alice and Bob are playing a match to see who is the first to win n games, for some fixed n > 0. Suppose Alice and Bob are equally competent, that is, each of them wins a game with probability 1/2. Further, suppose that they have already played i + j games, of which Alice won i and Bob won j. Give an efficient algorithm to compute the probability that Alice will go on to win the match. For example, if i = n − 1 and j = n − 3, then the probability that Alice will win the match is 7/8, since she must win any of the next three games.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education