Consider a graph where all edge weights are positive. We have computed shortest path using Dijkstra’s shortest path algorithm and total weight of shortest path is W.Consider below two statements about a shortest path from a source to a destination.i) If the graph is modified and all edge weights are multiplied with x, then the shortest path remains same and weight of shortest path becomes W*x (W multiplied by x).ii) If the graph is modified and x is added to all edge weights, then the shortest path remains same and weight of shortest path becomes W + n*x. Where n is number of edges on the shortest path.(A) Only (i) is always True(B) Only (ii) is always True(C) Both are always True(D) Neither (i) nor (ii) is always True

Consider a graph where all edge weights are positive. We have computed

1.	Consider a graph where all edge weights are positive. We have computed shortest path using Dijkstra’s shortest path algorithm and total weight of shortest path is W.Consider below two statements about a shortest path from a source to a destination.i) If the graph is modified and all edge weights are multiplied with x, then the shortest path remains same and weight of shortest path becomes Wx (W multiplied by x).ii) If the graph is modified and x is added to all edge weights, then the shortest path remains same and weight of shortest path becomes W + nx. Where n is number of edges on the shortest path.(A) Only (i) is always True(B) Only (ii) is always True(C) Both are always True(D) Neither (i) nor (ii) is always True
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Select the appropriate Passive voice for the above sentence.(A) Doctor be called at once.(B) Let the doctor be called at once.(C) Let us call the doctor at once.(D) At once the doctor be called.
Find the Integral value of f(x) = x * sinx within the limits 0, π.(A) π(B) 2π(C) π/2(D) 0
Choose the missing number in the series:9, 7, 12, 12, 15, 17, 18, 22, ?(A) 27(B) 21(C) 22(D) 24
Which of the below given sorting techniques has highest best-case runtime complexity.(A) Quick sort(B) Selection sort(C) Insertion sort(D) Bubble sort
‘A’ sells a DVD to ‘B’ at a gain of 17% and ‘B’ then sells it to ‘C’ at a loss of 25%. If ‘C’ pays Rupees 1053 to ‘B’. then what is the cost price of the DVD to ‘A’ ?(A) 1200(B) 1450(C) 1250(D) 1375
Let A = {a, b, c, d }, B = { p, q, r, s } denote sets.R : A –> B, R is a function from A to B. Then which of the following relations are not functions ?(i) { (a, p) (b, q) (c, r) }(ii) { (a, p) (b, q) (c, s) (d, r) }(iii) { (a, p) (b, s) (b, r) (c, q) }(A) (i) and (ii) only(B) (ii) and (iii) only(C) (i) and (iii) only(D) None of these
P and Q can do a work in 30 and 60 days respectively. They agreed to work together and finish the work for 1000 Rupees. But they worked only for 10 days. How much money should they together get ?(A) 500(B) 100(C) 800(D) 200
If (4446)x + (2222)x = (10001)x then value of (2342)x – (1656)x = (?)x(A) 453(B) 353(C) 893(D) 686
Four different pens (1, 2, 3, 4) are to be distributed at random in four pen stands marked as 1, 2, 3, 4. What is the probability that none of the pen occupies the place corresponding to its number ?(A) 17/24(B) 3/8(C) 1/2(D) 5/8
A and B are two sets. If |A| = 5 , |B| = 3 , then, the number of onto functions from A to B are ___ ?(A) 35(B) 150(C) 29(D) 27

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment