1
Question
If the organizers want to ensure that all participants travelling from S to T take the same time (travelling time and task time combined) regardless of the route they choose and the street from B to C is under repairs (and hence unusable), then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:
Open in App
Solution
The correct option is D Both (b) and (c)
The possible routes are -
RouteTotal TimeJunctionS−A−T14AS−B−A−T9A,BS−B−C−T7B,CS−D−C−T10C,DS−D−T13D
It is given that, for each of the routes, the only way to increase the total time is to impose task time at the junctions. Let the task time at A, B, C, D be a, b, c, d hours respectively. Now, the total time for each of the five routes will be as follows.
RouteTotal TimeS−A−T14+aS−B−A−T9+(a+b)S−B−C−T7+(b+c)S−D−C−T10+(c+d)S−D−T13+d
As B - C is unusable; S - B - C - T is not possible. From the remaining options, if we apply all of them:
RouteOption aOption bOption cOption dS−A−T161415S−B−A−T161415S−D−C−T151415S−D−T151415
Both option (b) and (c) are true, as in both the cases total time is same for each of the four routes.
The possible routes are -
RouteTotal TimeJunctionS−A−T14AS−B−A−T9A,BS−B−C−T7B,CS−D−C−T10C,DS−D−T13D
It is given that, for each of the routes, the only way to increase the total time is to impose task time at the junctions. Let the task time at A, B, C, D be a, b, c, d hours respectively.
Now, the total time for each of the five routes will be as follows.
RouteTotal TimeS−A−T14+aS−B−A−T9+(a+b)S−B−C−T7+(b+c)S−D−C−T10+(c+d)S−D−T13+d
As B - C is unusable; S - B - C - T is not possible. From the remaining options, if we apply all of them:
RouteOption aOption bOption cOption dS−A−T161415S−B−A−T161415S−D−C−T151415S−D−T151415
Both option (b) and (c) are true, as in both the cases total time is same for each of the four routes.
Suggest Corrections
0
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
