Home » Verbal Reasoning » Routes and Networks

What is the total number of ways to reach A to B in the network given?

Correct Answer: 16

Explanation:

As per the given above figure , we can see that
There are four ways to go from A to the first level of nodes. Each of these 4 nodes in turn leads into two more ways to go to the second level nodes.
Each of the second level nodes leads into two more ways to go to the third level nodes.
And from here we have only one way each to go to B.
Hence by fundamental principal of counting, total number of ways = 4 x 2 x 2 x 1 = 16 ways.

← Previous Question Next Question→

More Questions from Routes and Networks

4 cities are connected by a road network as shown in the figure. In how many ways can you start from any city and come back to it without travelling on the same road more than once?
What is the maximum quantity of natural gas S can receive?
For which 2 cities it can be safely concluded that they have natural gas plants?
What is the maximum quantity of natural gas than can be transported from M to R?
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
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:

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion