From the answer of previous question,
Total number of ways from A to B is 90.
Now we need to calculate total number of ways from B to C that is 13 (on the same logic)
Hence, total number of paths from A to C is 90 x 13 = 1170.
Map of the town is given as below:
It is given that Neelam took the shortest path hence she has to pass through path EF.
Number of ways to reach E from A is 2+2C2 = 4C2 = 6.
Number of ways to reach B from F is 4+2C2 = 6C2 = 15.
Hence total number of ways to reach B from A is 6 x 15 = 90.
From the solution of question number 25 ,
Maximum distance is when path taken is:
A ? D ? C ? B ? G ? E ? F ? H = 1300 + 500 + 200 + 400 + 400 + 300 + 600 = 3700 km.
Therefore , the maximum distance between A and H is 3700 km.
From solution of question number 26 ,
Starting from HEC: HECGBA, HECBA, HECA, HECDA (Total 4 paths)
Hence , the total number of such paths is 4 .
On the basis of above given diagram , we can say that
The minimum distance between A and H through D is HEDCA and distance is 500 + 500 + 500 + 600 = 2100.
Hence , required answer will be 2100 km.
As per the given above diagram , we can see that
For minimum distance path is HGCA = 400 + 400 + 600 = 1400
Therefore , the minimum distance between H to A without visiting city E is 1400 km .
As per the given conditions,
we require surveillance cameras that would cover all roads converging at an intersection. The cost for covering all the roads has to be minimum.
If we put a camera on '1', roads from '7' and '6' to 1 will be covered.
If we put a camera on intersection '2', roads converging from '3' to '2' will be covered.
If we put a camera on '3', roads from '3' to '5', '6' to '5' and '7' to '5' will be covered.
Now we are left with roads from 7 to 4 and from 6 to 4 both of them converge from 4 hence these will be covered by putting a camera on '4'. And then all the roads will be covered and the minimum cost is 2 + 5 + 1 + 4 = 12 lakhs
On the basis of above given question ,we can say that
Similar to the above answer cameras are put on 2, 5, 1 and 4 to minimize the cost.
As per the given above diagram , we can see that
Total number of paths from X to Y is 7.
From the solution of previous question ,
we have following results:
T3 = T7 = 0,
T1 = 20 + T2 + T4, T5 = 30 + T6 + T8.
From the given options option B satisfies the condition.
Hence , required answer will be 50, 20, 0, 10, 60, 20, 0, 10 .
On the basis of above given diagram , we can see that
Maximum expenditure is in path 3 and that is 260 + 50 x 6 = 260 + 300 = 560
Minimum expenditure is in path 5 and that is 230 + 50 x 3 = 230 + 150 = 380
? Required difference = Maximum expenditure is in path 3 - Minimum expenditure is in path 5 = 560 ? 380 = 180
Hence , Required difference is 180.
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.