Home » Verbal Reasoning » Routes and Networks

Eight cities A, B, C, D, E, F, G and H are connected with one-way roads R 1, R 2, R 3, R 4, R 5 and R 6 in the following manner: R1 leads from A to C via B; R2 leads from C to D and then via B to F; R3 leads from D to A and then via E to H; R4 leads from F to B via G; R5 leads from G to D; and R6 leads from F to H. The minimum number of road segments that have to be blocked in order to make all traffic form B to D impossible is

Correct Answer: 2

Explanation:

On the basis of above given question , we can say that
We can block B to D if A to B means R₁ and B to F means R₂ is blocked.
Therefore minimum 2 ways needed to be block.

← Previous Question Next Question→

More Questions from Routes and Networks

In the adjoining figure, the lines represent one-way roads allowing travel only northwards or only westwards. Along how many distinct routes can a car reach point B from point A?
If the government wants to ensure that all motorists travelling from S to T pay the same amount ( fuel costs and toll 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 toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is :
If the government wants to ensure that all routes from S to T get the same amount of traffic, then a feasible set of toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is :
The government wants to devise a toll policy such that the total cost to the commuters per trip is minimized. The policy should also ensure that not more than 70 percent of the total traffic passes through junction B. The cost incurred by the commuter travelling from point S to point T under this policy will be:
If the government wants to ensure that the traffic at S gets evenly distributed along streets from S to A, from S to B, and from S to D, then a feasible set of toll charged (in rupees) at junctions A, B, C, and D respectively to achieve this goal is:
If the government wants to ensure that no traffic flows on the street from D to T, while equal amount of traffic flows through junctions A and C, then a feasible set of toll charged (in rupees) at junctions A, B, C and D respectively to achieve this goal is
Find the ratio of maximum to minimum distance between A and H if condition is that traveling a city more than once is not allowed.
Find the total number of paths from city H to city A if condition is that traveling a city more than once is not allowed.
Find the minimum distance between H to A without visiting city E.
What is the minimum distance between H to A through D?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion