Question: There are total n number of Monkeys sitting on the branches of a huge Tree. As travelers offer Bananas and Peanuts, the Monkeys jump down the Tree. If every Monkey can eat k Bananas and j Peanuts. If total m number of Bananas and p number of Peanuts are offered by travelers, calculate how many Monkeys remain on the Tree after some of them jumped down to eat. At a time one Monkeys gets down and finishes eating and go to the other side of the road. The Monkey who climbed down does not climb up again after eating until the other Monkeys finish eating. Monkey can either eat k Bananas or j Peanuts. If for last Monkey there are less than k Bananas left on the ground or less than j Peanuts left on the ground, only that Monkey can eat Bananas(

Question: There are total n number of Monkeys sitting on the branches of a huge Tree. As travelers offer Bananas and Peanuts, the Monkeys jump down the Tree. If every Monkey can eat k Bananas and j Peanuts. If total m number of Bananas and p number of Peanuts are offered by travelers, calculate how many Monkeys remain on the Tree after some of them jumped down to eat. At a time one Monkeys gets down and finishes eating and go to the other side of the road. The Monkey who climbed down does not climb up again after eating until the other Monkeys finish eating. Monkey can either eat k Bananas or j Peanuts. If for last Monkey there are less than k Bananas left on the ground or less than j Peanuts left on the ground, only that Monkey can eat Bananas(

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.1: Two Puzzles

Problem 3P

See similar textbooks

Similar questions

There are 2016 passengers about to board a plane, numbered 1 through 2016 in that order. Each passenger is assigned to a seat equal to his or her own number. However, the first passenger disregards instructions and instead of sitting in seat number 1, chooses and sits down in a randomly chosen seat. Each subsequent passenger acts according to the following scheme: if their assigned seat is available, they will sit there; otherwise, they will pick at random from the remaining available seats and sit there. What is the probability that the 1512th passenger ends up sitting in their assigned seat? A. 1/2016 B. 1/2 C. 5/8 D. 3/4 E. None of the above
We are given three ropes with lengths n₁, n2, and n3. Our goal is to find the smallest value k such that we can fully cover the three ropes with smaller ropes of lengths 1,2,3,...,k (one rope from each length). For example, as the figure below shows, when n₁ = 5, n₂ 7, and n3 = 9, it is possible to cover all three ropes with smaller ropes of lengths 1, 2, 3, 4, 5, 6, that is, the output should be k = 6. = Devise a dynamic-programming solution that receives the three values of n₁, n2, and n3 and outputs k. It suffices to show Steps 1 and 2 in the DP paradigm in your solution. In Step 1, you must specify the subproblems, and how the value of the optimal solutions for smaller subproblems can be used to describe those of large subproblems. In Step 2, you must write down a recursive formula for the minimum number of operations to reconfigure. Hint: You may assume the value of k is guessed as kg, and solve the decision problem that asks whether ropes of lengths n₁, n2, n3 can be covered by…
A group of n tourists must cross a wide and deep river with no bridge in sight. They notice two 13-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?
A farmer has goat , a wolf & a cabbage on the west side of a river. He wants to get all of his animals & his cabbage across the river onto the east side. The farmer has row boat but he only has enough room for himself & one other thing . The wolf will eat the goat if they are left together alone. The goat will eat the cabbage if they are left together alone. How can the farmer get everything on the east side? i. Formulate this puzzle as search. ii.Find solution for this problem.
Imagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.
Four people start on one side to cross a rickety bridge. 17 minutes to cross them all. Nighttime, one torch. The bridge can only hold two persons. Anyone crossing must carry a torch. The torch must be carried, not flung. Person 1 crosses the bridge in one minute, person 2 in two, person 3 in five, and person 4 in ten. Pairs must walk at the slower person's pace. Specify a problem-solving algorithm.
Correct answer will be upvoted else Multiple Downvoted. Computer science. Gildong has a square board comprising of n lines and n sections of square cells, each comprising of a solitary digit (from 0 to 9). The cell at the j-th section of the I-th line can be addressed as (i,j), and the length of the side of every cell is 1. Gildong prefers enormous things, so for every digit d, he needs to find a triangle with the end goal that: Every vertex of the triangle is in the focal point of a cell. The digit of each vertex of the triangle is d. Somewhere around one side of the triangle is corresponding to one of the sides of the board. You might expect that a side of length 0 is corresponding to the two sides of the board. The space of the triangle is boosted. Obviously, he can't simply be content with tracking down these triangles with no guarantees. Along these lines, for every digit d, he will change the digit of precisely one cell of the board to d, then, at that point, track…
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plant with more pesticide content than the plant to its left. Example // pesticide levels Use a -indexed array. On day , plants and die leaving . On day , plant in dies leaving . There is no plant with a higher concentration of pesticide than the one to its left, so plants stop dying after day . Input Format The first line contains an integer , the size of the array .The next line contains space-separated integers . Constraints Sample Input 7 6 5 8 4 7 10 9 Sample Output 2 Explanation Initially all plants are alive. Plants = {(6,1), (5,2), (8,3), (4,4), (7,5),…
CT ser.
Josefine and her friends has invented a new game called Pillar Jumpers. In this game, a sequence of N pillars of non decreasing heights are placed next to each other. The player starts on the first pillar, and the target is to reach the la pillar in at most J jumps. The player has a certain jump strength S that determines how far he can jump. Let h; be t height of the i'th pillar for i e [1...N). The player can jump from pillar i to j iff. i
Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.
A school dance committee is to consist of 2 freshmen, 3 sophomores, 4 juniors, and 5 seniors. If 6 freshmen, 7 sophomores, 9 juniors, and 7 seniors are eligible to be on the committee, in how many ways can the committee be chosen? Your answer is: