Computer Science Question The first line consist a number X i.e., the number of test cases. The first line consists three space-separated integers N, Q1, and Q1. Then Q1 lines follow, each containing a description of a road proposed0. Each of these lines contains three space-separated integers p, q, and r, where p and q denote the end points of the road and r denotes the associated cost. Then Q1 lines follow, each containing a description of a road proposed by Brian's company in the same format. Output a single line for each test case. If it is impossible to choose a subset of the roads in such a way that for each pair of cities, there is exactly one path of roads connecting them, output a single line containing "No way" for that test case. Otherwise, output a single line containing two space-separated integers: the maximum profit Brian can gain and the minimum total cost of the chosen roads that yields the maximum profit. Input: 1 3 1 1 0 1 1 0 1 3 Output: No way

Computer Science Question The first line consist a number X i.e., the number of test cases. The first line consists three space-separated integers N, Q1, and Q1. Then Q1 lines follow, each containing a description of a road proposed0. Each of these lines contains three space-separated integers p, q, and r, where p and q denote the end points of the road and r denotes the associated cost. Then Q1 lines follow, each containing a description of a road proposed by Brian's company in the same format. Output a single line for each test case. If it is impossible to choose a subset of the roads in such a way that for each pair of cities, there is exactly one path of roads connecting them, output a single line containing "No way" for that test case. Otherwise, output a single line containing two space-separated integers: the maximum profit Brian can gain and the minimum total cost of the chosen roads that yields the maximum profit. Input: 1 3 1 1 0 1 1 0 1 3 Output: No way

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 3RP

See similar textbooks

Similar questions

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!
In the model in Example 15.5, suppose bonuses and penalties are incurred for earliness or lateness. Specifically, suppose a bonus of $2000 is received if the project is completed within 60 days, an extra bonus of $1000 is received if the project is completed within 58 days, and a penalty of $1000 is incurred for every full day past a project completion of 64 days. (For example, if the project is completed in 66.7 days, the penalty is $2000—two full days late.) Modify the model appropriately, and then run the simulation to find the distribution of the net monetary outcome (negative if a penalty, positive if a bonus). What is the expected value of this net amount? What is the probability of a $3000 total bonus? What is the probability of a penalty of at least $4000? Example 15.5 LAN PROJECT WITH UNCERTAIN ACTIVITY TIMES We again analyze the LAN project from Example 15.1, but we now assume that the activity durations are uncertain, with given probability distributions. The…
Complete the following applied optimization word problem. Include a well-labeled figure, clearly defined objective function of one variable, interval for which that variable is logical and supporting mathematical statements to justify that the optimal result is achieved for the function on the interval within a grammatically correct exposition. To mail a package with the United States Postal service without additional fees, the sum of the length and the girth of the package must be less than or equal to 92 inches, where the length is the length of the longest side and the girth is the distance around the package perpendicular to its length. Suppose Tom wants to mail a box with a length of 48 inches. What is the largest possible surface area that Tom’s package can have? Make sure that the length of the package corresponds to the longest side.
To cut an 'n' centimeter-long gold bar into 2 pieces costs $n. When a gold bar is cut into many pieces, the order in which the cuts occur can affect the total amount of costs. For example, to cut a 20 centimeter gold bar at length marks 2, 8, and 10 (numbering the length marks in ascending order from the left-hand end, starting from 1). If the cuts to occur in left-to-right order, then the first cut costs $20, the second cut costs $18 (cutting the remaining 18 centimeter bar at originally length mark 8), and the third cut costs $12, totaling $50. If the cuts to occur in right-to-left order, however, then the first cut costs $20 time, the second cut costs $10, and the third cut costs $8, totaling $38. In yet another order, the first cut is at 8 (costing $20), then the 2nd cut is at 2 (costing $8), and finally the third cut is at 10 (costing $12), for a total cost of $40. Given an 'n' centimeter-long gold bar G and an array C[1..m] containing the cutting points in ascending order): a.…
(a) Suppose there are seven finals to be scheduled. Suppose that the following pairs of courses have common students: 1 and 2, 1 and 3, 2 and 3, 2 and 4, 2 and 5, 2 and 7, 3 and 4, 3 and 6, 3 and 7, 4 and 5, 4 and 6, 5 and 6, 5 and 7, and 6 and 7. How the final exams can be scheduled so that no student has two exams at the same time?
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?
Problem 1: Let P(x, y) denote the statement “Student x has taken class y”, where the domain for x consists of all students in your class, and for y consists of all computer science courses at your school. Express each of the following quantifications in English.1. x y P(x, y)2. x y P(x, y)3. x y P(x, y)4. y x P(x, y)5. y x P(x, y)6. x y P(x, y)
Ma1. 1) On a Bank Reconciliation, if our check was written for $492.83 and was processed as such by the bank, but had been shown in our company's accounting records as a check for $498.23, we would code this as a C+ item.T rue or False 2) In the Bottom-Up method of calculating required revenue, we treat the amount of desired net income (once we have calculated how much it should be) as:a. a variable cost. b. a step cost. c. unnecessary for the calculation. d. a fixed item. e. none of the above. 3) A large F variance from budget in a revenue item should be investigated. True or False 4) If a Bank Reconciliation cannot be made to balance, then something unusual has occurred and must be investigated. True or False 5) In preparing a bank reconciliation, we will code an NSF check (using the fabulous Bessner system) as: a. a C+ item. b. a C- item. c. a B+ item. d. a B- item. e. none of the above. 6) If a company wants to end up with an AFTER-TAX profit of $25,000, and its tax rate is 38%,…
"Equatable and Comparable" in the Swift Programming: The Big Nerd Ranch Guide (2nd Ed.) e-book: Point’s current conformance to Comparable yields some confusing results. let c = Point(x: 3, y: 4) let d = Point(x: 2, y: 5) let cGreaterThanD = (c > d) // false let cLessThanD = (c < d) // false let cEqualToD = (c == d) // false As the above example demonstrates, the trouble arises in comparing two points when one point’s x and y properties are not both larger than the other point’s. In actuality, it is not reasonable to compare two points in this manner. Fix this problem by changing Point’s conformance to Comparable. Calculate each point’s Euclidean distance from the origin instead of comparing x and y values. This implementation should return true for a < b when a is closer to the origin than b. Use the formula shown in below Figure 25.1 to calculate a point’s Euclidean distance. Figure 25.1 Euclidean distance Euclidean distance
An optimum solution only applies to a mathematical model that represents the issue
Problem 5. An Electricity board charges the following rates mentioned in the table for the use of electricity. All users are charged Taka 50 as a meter charge for every month. If any user wants to change/replace his meter, he will be charged taka 2000. The monthly bill will be generated based on ● Customer Category ● Consumed Units ● Phase ● For Category 3 and 5 along with other parameters, you need to also consider flat rate, peak time, and off-peak time. Take input from the user, how many units were consumed during flat rate, peak, or off-peak time. ● Meter Charge Write a program to read the name of the user, Customer Category, Phase, number of units consumed and print out the monthly bill. Note that ● Phase, flat rate, peak time and off-peak time will be appeared based on the customer category. ● The monthly bill will be calculated following the number of Days in a month