Mr. White and Pinkman earned money from their first drug contract. There is an N type of dollar such as A1, A2, A3...... An, each value is different. They have an argument about money sharing. So they decide to throw a coin in order to decide who gets the first choice If the head (H) appears then Mr. White will get a chance to vote first and then Pinkman if not when he says Tails (T) it is time for Jessy Pinkman to vote first and then Mr. White. Each person will select the dollar value in his or her time and the person will not be able to select a dollar note that has already been used. This will continue until all the dollars are allocated between them and in each election, they will throw a coin to decide. You should find the one who receives the extra portion of the money and its value.

Mr. White and Pinkman earned money from their first drug contract. There is an N type of dollar such as A1, A2, A3...... An, each value is different. They have an argument about money sharing. So they decide to throw a coin in order to decide who gets the first choice If the head (H) appears then Mr. White will get a chance to vote first and then Pinkman if not when he says Tails (T) it is time for Jessy Pinkman to vote first and then Mr. White. Each person will select the dollar value in his or her time and the person will not be able to select a dollar note that has already been used. This will continue until all the dollars are allocated between them and in each election, they will throw a coin to decide. You should find the one who receives the extra portion of the money and its value.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 12RP

See similar textbooks

Similar questions

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…
You are given a grid having N rows and M columns. A grid square can either be blocked or empty. Blocked squares are represented by a '#' and empty squares are represented by '.'. Find the number of ways to tile the grid using L shaped bricks. A L brick has one side of length three units while other of length 2 units. All empty squares in the grid should be covered by exactly one of the L shaped tiles, and blocked squares should not be covered by any tile. The bricks can be used in any orientation (they can be rotated or flipped). Input Format The first line contains the number of test cases T. T test cases follow. Each test case contains N and M on the first line, followed by N lines describing each row of the grid. Constraints 1 <= T <= 501 <= N <= 201 <= M <= 8Each grid square will be either '.' or '#'. Output Format Output the number of ways to tile the grid. Output each answer modulo 1000000007. Sample Input 3 2 4 .... .... 3 3 ...…
Write a python program based on the discussion we had on the last day of class, to train a network with two hidden layers each with 5 neurons. Finish the gradient computation we did in class, and implement a steepest decent search for a network which minimizes the cost function. Once you believe that your network is trained, compute the value of n(1, 1) and see what you get. Bonus: If you easily get this to work, then try to generalize to K neurons in each of the two hidden layers. Does the training work better with more neurons?
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you ll in the values is the correct one.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Prove that the coin changing problem exhibits optimal substructure. Design a recursive backtracking (brute-force) algorithm that returns the minimum number of coins needed to make change for n cents for any set of k different coin denominations. Write down the pseudocode and prove that your algorithm is correct.
Computer Science Please do a simple JAVA code for the Monty Hall problem. Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? Please have the following Main allows the person playing to choose any door class door: should have data member methods Class person: should have data methods
Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit, is there anything smarter we could do? (b) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.] (c) Gradient ascent search is prone to local optima just like hill climbing.…
Write the code in Java and C++ ....Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting.Consider that all the trains arrive on the same day and leave on the same day. Arrival and departure time can never be the same for a train but we can have arrival time of one train equal to departure time of the other. At any given instance of time, same platform can not be used for both departure of a train and arrival of another train. In such cases, we need different platforms. Example 1: Input: n = 6 arr[] = {0900, 0940, 0950, 1100, 1500, 1800}dep[] = {0910, 1200, 1120, 1130, 1900, 2000}Output: 3Explanation: Minimum 3 platforms are required to safely arrive and depart all trains.Example 2: Input: n = 3arr[] = {0900, 1100, 1235}dep[] = {1000, 1200, 1240}Output: 1Explanation: Only 1 platform is required to safely manage the arrival and departure of all trains.
You are given an instance of a problem where you have an n x n grid of squares. Each square can be unpainted or can have a hole, so you cannot go on the square with a hole. The objective is to paint all the squares that do not have a hole. You start in the square (0,0) which is unpainted. The actions you can do are: (1) paint the square you are on if it is not painted; (2) move, either vertically or horizontally, to an adjacent square inside the grid that is not painted and does not have a hole. a. Describe a state-space representation for the problem, specifying the state representation, the initial state, the goal condition, and the actions. b. Is the state space finite? Is it a tree or a graph? c. Propose a heuristic for the problem. Is your heuristics admissible or not? Explain briefly your answer
Can someone translate this into java, please? Student Course::FindStudentHighestGpa(){ int totalStudent = roster.size(); double maxGpa = 0; // Iterate through every student and find the maximum GPA for(int i = 0;i < totalStudent;i++) { if(roster[i].GetGPA() >= maxGpa) maxGpa = roster[i].GetGPA(); } // return student having maximum GPA for(int i = 0;i < totalStudent;i++) { if(roster[i].GetGPA() == maxGpa) return roster[i]; }}
In the famous dining philosophers problem, a bunch of philosophers aresitting around a circular table with one chopstick between each of them. A philosopher needsboth chopsticks to eat, and always picks up the left chopstick before the right one. A deadlockcould potentially occur if all the philosophers reached for the left chopstick at the same time. Usingthreads and locks, implement a simulation of the dining philosophers problem that prevents deadlocks.