Homework Answers
This is for dynamic programming
algorithm. Because Greedy algorithm doesn't give optimal solution.
Then Dynamic programming is more efficientcompare to greedy
algorithm
Q1: Here we consider finding the length of the shortest path between all pairs of nodes...
Q1: Here we consider finding the length of the shortest path between all pairs of nodes in an undirected, weighted graph G. For simplicity, assume that the n nodes are labeled 1; 2; : : : ; n, that the weight wij of any edge e = (i; j) is positive and that there is an edge between every pair of nodes. In this question, the goal is to solve this via dynamic programming. Note that the algorithm you will...
The force field F (x, y) = (x + 4y)i + (x^2 − 3)j acts on an object traveling from (0, 0) to (0, 1). The object moves along the path x = c(y − y^2 ) with 0 ≤ y ≤ 1. Determine the value of c that minim...
The force field F (x, y) = (x + 4y)i + (x^2 − 3)j acts on an object traveling from (0, 0) to (0, 1). The object moves along the path x = c(y − y^2 ) with 0 ≤ y ≤ 1. Determine the value of c that minimizes the work done on the object by the force field. Please use the line work integral, and optimization
There are n trading posts numbered 1 to n as you travel downstream. At any trading...
There are n trading posts numbered 1 to n as you travel
downstream. At any trading post i you can rent a canoe to be
returned at any of the downstream trading posts j>i. You are
given a cost array R(i,j) giving the cost of these rentals for all
1≤i<j≤n. We can assume that R(i,i)=0, and that you can't go
upriver (so perhaps R(i,j)= ∞ if i>j). For example, one cost
array with n=4 might be the following.
The problem...
5. If we apply binary dilation to the same large object twice using the same small...
5. If we apply binary dilation to the same large object twice using the same small structuring element, the effect, if any, of the second dilation on the object is that the object: (a) is unchanged (b) is completely removed (c) becomes larger (d) becomes smaller (e) does not change 6. Which of the following is/are true? (a) Dijkstra's algorithm can be used to find shortest paths in a network (b) Dijkstra's algorithm is a method to find straight lines...
Consider the following undirected weighted graph where you want to find a path from A to...
Consider the following undirected weighted graph where you want to find a path from A to G. A / \ B --- C \ / \ G --- H Weights (costs) of the edges are W(AB) = 1; W(AC) = 3; W(BC) = 1; W(BG) = 9; W(CG) = 5; W(CH) = 2; W(GH) = 1, and the heuristic estimates (h(n)) to the goal node, G, are h(A) = 5, h(B) = 4, h(C) = 1, h(G) = 0, h(H)...
Please help me with these questions, show working. thank you I-(8z2+3e3rcos(5y) i-( 5e3rsin(5y)) j+16xz k The vector fi...
Please help me with these questions, show working. thank you
I-(8z2+3e3rcos(5y) i-( 5e3rsin(5y)) j+16xz k The vector field I is conservative, find a scalar potential function f(x.y,z) such that I grad f and f(0,0,0) 1 Your answer should be expressed using the correct Maple syntax; for example, it might be: 2*x^2"y+5*z*exp(-9*y) cos(4*z) Do not use decimal approximations all numbers must be correct Maple expressions. The scalar potential is f(x,y,z) Skipped Change the order of integration and evaluate the following double...
1. Two firms compete in a linear city of length 1 unit. Consumers are uniformly located...
1. Two firms compete in a linear city of length 1 unit. Consumers are uniformly located along the city. Consumer i's utility derived from buying firm j's product is given by jj-(-x)2-Pj where j 1,2 indicate the two firms, t is the per unit cost of travelling along the city, is the location of consumer i, x is the location of firm j, and pj is the price of product j. Product one contains some intrinsically superior features and 22,...
I need help with B, C, D. These are Calc 3 problems 32. Suppose a particle...
I need help with B, C, D. These are Calc 3 problems
32. Suppose a particle of mass m has position given by r(0) =< 1,0,0 >, and velocity given by v(0)0,1,-1 > at time t = 0. Also, assume that for every time t 20 the particle experiences only the force given by the vector function F(t) = m < -cos(t), 0, sin(t) >. Disregard units in this problem a) Use Newton's Second Law, F(t) = ma(t) (where a(t)...
can anyone provide answers with explaination ? thanks a lot I. In the example of recycling...
can anyone provide answers with explaination ? thanks
a lot
I. In the example of recycling the elements of a list in O1) time, which situation holds? A. Both lists are circular B. Both ists are not circular C. The list to be recycled is circular, the garbage list is not D. The garbage list is circular, the list to be recycled is not 2. What is the worst-case time to perform MINIMUML) for a sorted, doubly-linked list with nodes?...
please help ! Q1-Q6 1. Let F (3x - 4y +22)i+(4x +2y 3z2)j + (2xz moving once around an 4y zk be a vector field. Co...
please help ! Q1-Q6
1. Let F (3x - 4y +22)i+(4x +2y 3z2)j + (2xz moving once around an 4y zk be a vector field. Consider a particle ellipse C given by parametrization r= 4 cos ti +3 sin tj. Find the work done. 3 3 = 3, y=-- and 2 1 2. Let D be the region in the first quadrant bounded by the lines y=-r1, y 4 + 1. Use the transformation u 3 2y, v r +...
There are n trading posts numbered 1 to n as you travel
downstream. At any trading post i you can rent a canoe to be
returned at any of the downstream trading posts j>i. You are
given a cost array R(i,j) giving the cost of these rentals for all
1≤i<j≤n. We can assume that R(i,i)=0, and that you can't go
upriver (so perhaps R(i,j)= ∞ if i>j). For example, one cost
array with n=4 might be the following.
The problem...
5. If we apply binary dilation to the same large object twice using the same small structuring element, the effect, if any, of the second dilation on the object is that the object: (a) is unchanged (b) is completely removed (c) becomes larger (d) becomes smaller (e) does not change 6. Which of the following is/are true? (a) Dijkstra's algorithm can be used to find shortest paths in a network (b) Dijkstra's algorithm is a method to find straight lines...
Please help me with these questions, show working. thank you
I-(8z2+3e3rcos(5y) i-( 5e3rsin(5y)) j+16xz k The vector field I is conservative, find a scalar potential function f(x.y,z) such that I grad f and f(0,0,0) 1 Your answer should be expressed using the correct Maple syntax; for example, it might be: 2*x^2"y+5*z*exp(-9*y) cos(4*z) Do not use decimal approximations all numbers must be correct Maple expressions. The scalar potential is f(x,y,z) Skipped Change the order of integration and evaluate the following double...
1. Two firms compete in a linear city of length 1 unit. Consumers are uniformly located along the city. Consumer i's utility derived from buying firm j's product is given by jj-(-x)2-Pj where j 1,2 indicate the two firms, t is the per unit cost of travelling along the city, is the location of consumer i, x is the location of firm j, and pj is the price of product j. Product one contains some intrinsically superior features and 22,...
I need help with B, C, D. These are Calc 3 problems
32. Suppose a particle of mass m has position given by r(0) =< 1,0,0 >, and velocity given by v(0)0,1,-1 > at time t = 0. Also, assume that for every time t 20 the particle experiences only the force given by the vector function F(t) = m < -cos(t), 0, sin(t) >. Disregard units in this problem a) Use Newton's Second Law, F(t) = ma(t) (where a(t)...
can anyone provide answers with explaination ? thanks
a lot
I. In the example of recycling the elements of a list in O1) time, which situation holds? A. Both lists are circular B. Both ists are not circular C. The list to be recycled is circular, the garbage list is not D. The garbage list is circular, the list to be recycled is not 2. What is the worst-case time to perform MINIMUML) for a sorted, doubly-linked list with nodes?...
please help ! Q1-Q6
1. Let F (3x - 4y +22)i+(4x +2y 3z2)j + (2xz moving once around an 4y zk be a vector field. Consider a particle ellipse C given by parametrization r= 4 cos ti +3 sin tj. Find the work done. 3 3 = 3, y=-- and 2 1 2. Let D be the region in the first quadrant bounded by the lines y=-r1, y 4 + 1. Use the transformation u 3 2y, v r +...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 11 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 11 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 11 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 11 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 11 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 11 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 11 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 11 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 11 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 11 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 11 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 11 months ago