I need the answer as soon as possible Suppose one can invest in the ABC corporation.One can buy one unit of stock only one time andthen sell it at a later date, buying and sellingafter the close of trading for the day. Considerthe following information about the price of thestock in the ABC corporation after the close ofthe trading over a period of 10 days.Day 0 1 2 3 46 | 7 89.Price 808510292110100108120117112Find a sequence of days over which the netchange from the first day to the last ismaximum, where the change on day i is thedifference between the prices after day i - 1 andafter day i.

Answered: Image /qna-images/answer/f7648fae-770c-4a18-9fda-bd9b7356136e.jpg

Answered: pration me an ling sider

Engineering

Computer Science

pration me an ling sider

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.3: How To Maximize The Probability Of A Favorable Event Occurring

Problem 1P

See similar textbooks

Similar questions

2. A certain company gives commission to each of their salesmen based from the type of appliance sold andthe price of the appliance. Below are the given rates that will be used in computing for the salesman’scommission:If type is Commission is2, 5, 6 15% of the price4, 8, 10 20% of the price3, 1, 9,7 25% of the priceInput salesman’s name, type of appliance sold, and price of the appliance. Compute and print thesalesman’s commission.
In the refrigerator example, suppose the warranty worksas follows. If a refrigerator fails at any time within 5 yearsof purchase, we give the consumer a prorated refund on the$500 purchase price. For example, if the refrigerator failsafter 4 years, we pay the customer $100. If the refrigeratorfails after 3 years, we pay the customer $200. Estimate ourexpected warranty expense per refrigerator sold.
Answer the following: This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3=1 and −1 to any position with O3=1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)−(3O2(s)+O1(s)). a. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one O on the board), taking symmetry into account. b. Mark on your tree the evaluations of all the positions at depth 2. c .Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move. Provide original solutions including original diagram for part a!
Answer the following: This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3=1 and −1 to any position with O3=1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)−(3O2(s)+O1(s)). a. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one O on the board), taking symmetry into account. b. Mark on your tree the evaluations of all the positions at depth 2. c .Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move. Provide original solution!
A seller has an indivisible asset to sell. Her reservation value for the asset is s, which she knows privately. A potential buyer thinks that the assetís value to him is b, which he privately knows. Assume that s and b are independently and uniformly drawn from [0, 1]. If the seller sells the asset to the buyer for a price of p, the seller's payoff is p-s and the buyer's payoffis b-p. Suppose simultaneously the buyer makes an offer p1 and the seller makes an offer p2. A transaction occurs if p1>=p2, and the transaction price is 1/2 (p1 + p2). Suppose the buyer uses a strategy p1(b) = 1/12 + (2/3)b and the seller uses a strategy p2(s) = 1/4 + (2/3)s. Suppose the buyer's value is 3/4 and the seller's valuation is 1/4. Will there be a transaction? Explain. Is this strategy profile a Bayesian Nash equilibrium? Explain.
Pretend you have five employees who would like to know exactly how much their bi-weekly pay will be once all of their deductions are taken off. Their weekly pay is as follows: Emp #1. $1100 Emp #2. $1300 Emp #3. $1500 Emp #4. $1700 Emp #5. $2300 *Taxation *
2. A safe has 5 locks v, w, y and z; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner.Mr. A has keys for locks v and x. Mr. B has keys for locks v and y. Mr. C has keys for locks w and y. Mr. D has keys for locks x and z. Mr. E has keys for locks v and z.a) Determine the minimal number of executives required to open the safe.b) Find all the combinations of executives that can open the safe; write and expression f(A, B, C, D, E) which specifies when the safe can be opened as a function of what executives are present.c) Who is the essential executive?
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…
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.
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
This problem exercises the basic concepts of game playing, using tic-tac-toe (noughtsand crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3 = 1 and −1 to any position with O3 = 1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval (s) = 3X2(s)+X1(s)−(3O2(s)+O1(s))."Mark on your tree the evaluations of all the positions at depth 2."
A nine character long password is to be created using lower-case letters, four special characters {!, @, #, $} and digits. For the password to be valid, it must contain at least one lower-case letter, one of the given special characters and one digit. What is the probability that a randomly generated nine character password is valid? Assume that the password is generated using only the lower-case letters, the given special characters and digits