kindly change the program following the procedure on the problem. please list the changes you have made on the program t..thank you 5. Consider the tollowing scenario:A high school has 1000 students and 1000 lockers, one locker for each student. On the first day ofschool, the principal plays the following game: She asks the first student to open all the lockers. Shethen asks the second student to close all the even-numbered lockers. The third student is asked tocheck every third locker. If it is open, the student closes it; if it is closed, the student opens it. Thefourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed,the student opens it. The remaining students continue this game. In general, the nth student checksevery nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all theThe progras below, uhile has the correct output, doesn't follow the gane's logie at all.Instead, it follows a certain pattern thats present sn the gane.Consider the 10eth locker. Following the ganes rules, this locker uhould be visited by the 1st, 2nd,rd, 4th, Sth, 1eth, 2eth, 2sth, setn, and s0eth student. Coincidentally, these are also the positivedivisors of 100. Sinilarly,. the eth locker is visited by the students whose nubers are 1, 2, 3, 5, 610, 15, and e. Note that ir the numbers of positive divisors of a 1locker number is odd, then at theend of the gane, the locker is open. 14 the nubers of positive divisors of a locker nuber is even,then at the end of the gam, the locker is closed.import java.util.Scanner;public člasS Mitertxanipublic statie void main(Stringt) args)(Scanner keyboard - ne Scanner (Systen.in):int studentvisitcount - e;Systen.out.print("Enter the nunber of lockers: "):int nunberofLockers - console.nextInt ():for(int e usberofeckers; w+)(studentvisitCountfor(int ye, y, ye1FCstudentvisitcount21-0)Systen.out.print(ye" "):Systen.out.printin("The nunber of lockers and students are: "enunberOFLockers):Systen.out.print ("The locker nubers of lockers that are left open at the end of the gane are: "):students have taken turns, some of the lockers are open and some are closed.The program below, when ran, will prompt the user to enter the number of lockers in the school.After the game is over, the program will output the number of lockers and the lockers numbers ofthe lockers that are open. However, the statements are in the wrong order, and there are somebugs in this program. Rearrange the statements and also find and remove the bugs so that theprogram can run properly.. Underline the changes you have made.

Consider the tollowing scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the

Consider the tollowing scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter13: Decision Making Under Uncertainty

Section13.4: Decision Trees

Problem 9P

See similar textbooks

Similar questions

Consider the following scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program below, when ran, will prompt the user to enter the number of lockers in the school. After the game is over, the program will output the number of…
Consider the following scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program below, when ran, will prompt the user to enter the number of lockers in the school. After the game is over, the program will output the number of…
A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, theprincipal plays the following game: She asks the first student to open all the lockers. She then asks the secondstudent to close all the even-numbered lockers. The third student is asked to check every third locker. If it isopen, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourthlocker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continuethis game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed,the student opens it. After all the students have taken turns, some of the lockers are open and some are closed.The program below, when ran, will prompt the user to enter the number of lockers in the school. After thegame is over, the program will output the number of lockers and the lockers numbers of the lockers…
Three prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together. Pick a beginning cell (r1,c1) with non-zero worth. Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2. Lessening the worth of the beginning cell by some sure non-zero integer. Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that: a most limited way is one that goes through the most un-number of cells; all cells on this way barring the beginning cell, yet the completing cell might be altered; the subsequent worth of every cell should be a non-negative integer; the cells are changed freely and not really by a similar worth. On the off chance that the beginning and finishing cells are something very…
In the new post-apocalyptic world, the world queen is desperately concernedabout the birth rate. Therefore, she decrees that all families should ensure that they have one girl orelse they face massive fines. If all families abide by this policy-that is, they have continue to havechildren until they have one girl, at which point they immediately stop-what will the gender ratioof the new generation be? (Assume that the odds of someone having a boy or a girl on any givenpregnancy is equal.) Solve this out logically and then write a computer simulation of it.
The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M = 0 and N = 5, players are eliminated in order, and player 5 wins. If M = 1 and N = 5, the order of elimination is 2, 4, 1, 5. Write a C program to solve the Josephus problem for general values of M and N. Try to make your program as efficient as possible. Make sure you dispose of cells. What is the running time of your program? If M = 1, what is the running time of your program? How is the actual speed affected by the delete routine for large values of N (N > 100,000)? ps. provide a screenshot of output, thankss
A spinner with three equal sections is being used in a game. One section is labeled “0 points,” and two sections are labeled “2 points.” A player can decide not to spin the spinner and score 1 point. Each player gets one turn, and the player with the higher score wins; in case of a tie, the winner is decided by one flip of a fair coin. Alex takes his turn first. Eddie, knowing Alex’s score, takes his turn next. If both players use strategies that maximize their winning probabilities, what is the probability that Alex wins? a 1/3 b 1/2 c 2/3 d 4/9
In a prison, there is a door b/w any pair of adjacent cells and one exit guarded by a guard G. One prisoner is a maniac M which kills anybody he can see when he enters a cell. If M returns to the cell with his victim, then he loses consciousness and stops. In the evening all inmates and the guard went to sleep in their cells. In the morning, maniac M is gone and all other prisoners with the guard were found dead in their cells. Show the route of the maniac.
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment.If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profitof 4.5 dollar.For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100.Complete the RECURSIVE methods below that take an array of integers (investments)and an iterator (always sets to ZERO(‘0’) when the…
Consider the following game between two players: Both players simultaneously declare "one" or "two". Player 1 wins if the sum of the two declared numbers is odd and Player 2 wins if the sum is even. In either case the loser is obliged to pay the winner (in tokens) the sum of the two declared numbers. So Player 1 may have to pay 2 or 4 tokens or may win 3 tokens. You can imagine a single session between two players involving many games. At the end of a session, one player may have won many tokens from the other. Write a computer program in Java that allows a user to play a session (many games) against the computer. Both players should begin with 0 tokens and play until the human wants to quit. (Note: this means that one player will have a negative amount of tokens at the end and one player will have a positive amount.) When the human quits, the number of tokens each player has should be displayed before ending the session. The human should be given the choice to be either the "odd" or…
You and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift for someone else. To see how this whole thing works, let’s consider the following example. Suppose there are 7 people A, B, C, D, E, F, and G. We denote x → y to mean “x gives a gift to y.” If the gift exchange starts with person A, then they give a gift to E. Then E gives a gift to B. And it is entirely possible that B gives a gift to A; in such a case we have completed a “cycle.” In case a cycle occurs, the gift exchange resumes with another person that hasn’t given their gift yet. If the gift exchange resumes with person D, then they give a gift to G. Then G gives a gift to F. Then F gives a gift to C. Then finally C gives a gift to D, which completes another cycle. Since all of the people have given their gifts, the giftexchange is done, otherwise the gift exchange resumes again with another person. All in all, there are two cycles that occurred during the gift exchange: A → E → B → A…