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 thestudents 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. RENAME THE CLASS TOUnderline the changes you have made.The program below, while has the correct output, doesn't follow the game's logic at all.* Instead, it follows a certain pattern that's present in the game.Consider the 1eeth locker. Following the games rules, this locker should be visited by the 1st, 2nd,3rd, 4th, Sth, 1eth, 20th, 25th, seth, and 100th student. Coincidentally, these are also the positivedivisors of 100. Similarly, the 30th locker is visited by the students whose numbers are 1, 2, 3, 5, 610, 15, and 30. Note that if the numbers of positive divisors of a locker number is odd, then at the• end of the game, the locker is open. if the numbers of positive divisors of a locker number is even,then at the end of the game, the locker is closed.import java.util.Scanner;public class MidtermExam3(public static void main(String[] args){Scanner keyboard - new Scanner (System.in);int studentvisitCount - 0;System.out.print("Enter the number of lockers: ");int numberofLockers- console.nextInt();for(int x-0; x<-numberofLockers; x++){if(xxy==0){studentvisitCount++;for(int y-e; ye=x; y++){if(studentvisitCountX2!-0){System.out.print(y+" ");System.out.printin("The number of lockers and students are: "+numberofLockers);System.out.print("The locker numbers of lockers that are left open at the end of the game are: ");

public static void main(String[] args) { Scanner keyboard = new Scanner(System.in); int…

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 lockers and the lockers numbers of the lockers that are open. However, the statements are in the wrong order, and there are some bugs in this program. Rearrange the statements and also find and remove the bugs so that the program can run properly. RENAME THE CLASS TO Underline the changes you have made.

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 lockers and the lockers numbers of the lockers that are open. However, the statements are in the wrong order, and there are some bugs in this program. Rearrange the statements and also find and remove the bugs so that the program can run properly. RENAME THE CLASS TO Underline the changes you have made.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

In the Dice Roll game, the player begins with a score of 1000. The player is prompted for the numberof points to risk and a second prompt asks the player to choose either high or low. The player rollstwo dice and the outcome is compared to the player’s choice of high or low. If the dice total is between2 and 6 inclusive, then it is considered “low”. A total between 8 and 12 inclusive is “high”. A total of7 is neither high nor low, and the player loses the points at risk. If the player had called correctly, thepoints at risk are doubled and added to the total points. For a wrong call, the player loses the points atrisk. Create a DiceRollGame application that uses a DRPlayer object based on this specification. TheDRPlayer object should have two Die member variables that represent the dice. The Die class shoulduse a random number generator to determine the outcome in a roll() method. Application outputshould look similar to:
Python tic tac toe. Tic tac toe is a very popular game. Only two players can play at a time. Game Rules Traditionally the first player plays with "X". So you can decide who wants to go with "X" and who wants to go with "O". Only one player can play at a time. If any of the players have filled a square then the other player and the same player cannot override that square. There are only two conditions that may match will be a draw or may win. The player that succeeds in placing three respective marks (X or O) in a horizontal, vertical, or diagonal row wins the game. Winning condition Whoever places three respective marks (X or O) horizontally, vertically, or diagonally will be the winner. Submit your code and screenshots of your code in action. Hints : Have a function that draws the board Have a function that checks position if empty or not Have a function that checks player or won or not expected output:
Description: Raghu and Sayan both like to eat (a lot) but since they are also looking after their health, they can only eat a limited amount of calories per day. So when Kuldeep invites them to a party, both Raghu and Sayan decide to play a game. The game is simple, both Raghu and Sayan will eat the dishes served at the party till they are full, and the one who eats maximum number of distinct dishes is the winner. However, both of them can only eat a dishes if they can finish it completely i.e. if Raghu can eat only 50 kCal in a day and has already eaten dishes worth 40 kCal, then he can't eat a dish with calorie value greater than 10 kCal. Given that all the dishes served at the party are infinite in number, (Kuldeep doesn't want any of his friends to miss on any dish) represented by their calorie value(in kCal) and the amount of kCal Raghu and Sayan can eat in a day, your job is to find out who'll win, in case of a tie print "Tie" (quotes for clarity). Input: First line contains…
Stick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…
Stick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…
1. Astronomy Board Game In an astronomy board game, N planets in an imaginary universe do not follow the normal law of gravitation. All the planets are positioned in a row. The planetary system can be in a stable state only if the sum of the mass of all planets at even positions is equal to the sum of the mass of planets at the odd positions. Initially, the system is not stable, but a player can destroy one planet to make it stable. Find the planet that should be destroyed to make the system stable. If no such planet exists, then return -1. If there are multiple such planets, then destroy the planet with the smallest index and return the index of the destroyed planet. Example Let N=5 and planets = [2,4,6,3,4]. Destroying the fourth planet of mass 3 will result in planets= [2,4,6,4], and here, the sum of odd positioned planets is (2+6)=8, and the sum of even positioned planets is (4+4)=8, and both are equal now. Hence, we destroy the fourth planet. Function Description Complete the…
Tic-Tac-Toe For this question, you will be implementing a simple Tic-Tac-Toe game without the graphics. Here is how it works: • First, it is randomly determined if the user starts the game or the computer and this information is shown to the user. The player who starts always starts as "X". • The players (computer and the user) will then take turns in playing. The computer will choose a random empty spot on its turn. The user enters its choice in the console. • Each of the empty spots have a corresponding number that the players choose on their turn. If the user enters anything other than the number of an empty spot (not yet filled with "X" or "O"), it will not be accepted, and they will be prompted to enter a correct number. 2 4 7 8 • After each turn, two things need to be done: 1) displaying the updated board 2) checking if anyone has won (it should be printed who has won – the user or the computer). The game goes on until someone wins or until all the 9 empty spots are filled and no…
Pig is a game that has two players that alternate turns rolling dice. In this case, there will be one human player and one computer player. Each player’s goal is to get 100 points rolled on a normal six-sided die first. Each turn consists of rolling the die repeatedly until you decide to stop or until you roll a 1. For each roll: • If you roll a 2, 3, 4, 5, or 6 –you will add the amount rolled to your score.• If you roll a 1 – your turn ends and you receive zero points for that entire turn (You will keep whatever points you had before your turn started)• If you decide to stop rolling at any point in your turn, your points for that turn are then added to the overall score. The overall score is then safe from future rolls.Use functions to break apart the code into logical portions
Nim is a two-player game played with several piles of stones. You can use as many piles and as many stones in each pile as you want, but in order to better understand the game, we'll start off with just a few small piles of stones (see figure 1 below). Pile 1 Pile 1 Pile 2 The two players take turns removing stones from the game. On each turn, the player removing stones can only take stones from one pile, but they can remove as many stones from that pile as they want (please note, a player must remove atleast 1 stone from a pile during his/her turn). If they want, they can even remove the entire pile from the game! The winner is the player who removes the final stone (avoid taking the last stone - see figure 2 below). Pile 2 Pile 3 Pile 3 Let's say its Max (player 1) turn to play. Then Max can win by simply removing a stone from Pile 2 or Pile 3 Draw a game tree (upto depth level 2) for the given version of the Nim game. Please consider figure 1 as your initial game configuration/state…
BLACKJACK DO not use jquery strictly java script Black Jack is a simple card game that is also often called 21. The point of the game is to get a value as close to 21 without going over. A player that obtains the score of 21 with only 2 cards is said to have a Black Jack. Rules of the game: There are 2 types of participants in a game of Black Jack, the dealer and the players. The players play against the dealer and not against each other. In order to win, the player must have a hand value superior to that of the dealer’s. The game starts with each player receiving 2 cards, the dealer receiving 2 cards. Each player has the option to add an additional cards (1 by 1) to his hand (Draw) or to stay with the cards he currently has (Hold). If at any point, the player’s total exceeds 21, he automatically loses the hand (Bust). When all players complete this process, the dealer gets to complete his hand. As long as the dealer’s point total is 16 or less, he must draw a new card. As soon as…
A video player plays a game in which the character competes in a hurdle race. Hurdles are of varying heights, and the characters have a maximum height they can jump. There is a magic potion they can take that will increase their maximum jump height by unit for each dose. How many doses of the potion must the character take to be able to jump all of the hurdles. If the character can already clear all of the hurdles, return . Example The character can jump unit high initially and must take doses of potion to be able to jump all of the hurdles. Function Description Complete the hurdleRace function in the editor below. hurdleRace has the following parameter(s): int k: the height the character can jump naturally int height[n]: the heights of each hurdle Returns int: the minimum number of doses required, always or more Input Format The first line contains two space-separated integers and , the number of hurdles and the maximum height the character can jump naturally.The…
Kingdom of Trolls is celebrating their Kingdom Day and one of the activities that is taking place is a game where a player rolls a magic ball down the hill on a path with spikes. As the ball rolls down, it strikes a spike and bursts open to release a number of smaller balls (in our simulated game, the number of smaller balls is a randomly generated integer between 2 and 6, inclusive). As the smaller balls further roll down, when one strikes a spike, that ball and all its sibling balls burst and each generates another set of smaller balls (using the same random number already generated for the first roll). The balls keep rolling downhill and striking spikes and bursting into smaller balls until a golden ball is released by one of the bursts. At this time, the game is over and the player is told how many balls were generated during the last burst (including the golden ball). The game is played by two players at a time and the player who had the lowest number of balls generated on the…