There are 3 places in a city namely A, B and C. There are 4 routes a1, a2, a3 and a4 from A to B & there are 2 different routes, b1 and b2 from B to C. Find the number of ways he
can go from place A to C via B.

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C 8
(i) In the first way, he can go from A to B in 4 routes and
(ii) In the second way, he can go from B to C in 2 different routes.
Therefore, the total number of ways in which he can travel is 8 $(4 \times 2$ ) routes.

Suggest Corrections

Similar questions

Q. There are 3 places in a city namely A, B and C. There are 3 routes a1, a2 and a3 from A to B & there are 2 different routes, b1 and b2 from B to C. Find the number of ways he
can go from place A to C via B.

Q. There are three stations

A, B

and

C

, five routes for going from station

A

to station

B

and four routes for going from station

B

to station

C

.
Find the number of different ways through which a person can go from station

A

C

via

B

Q. A, B and C are 3 cities that form a triangle and where every city is connected to every other one by at least one direct route. There are 33 routes direct and indirect from A to C and there are 23 direct routes from B to A. How many direct routes are there from A to C?

Q. There are three cities: A, B and C. Each of these cities is connected with the other two cities by at least one direct road. If a traveller wants to go from one city (origin) to another city (destination), she can do so either by traversing a road connecting the two cities directly, or by traversing two roads, the first connecting the origin to the third city and the second connecting the third city to the destination. In all, there are 33 routes from A to B (including those via C). Similarly, there are 23 routes from B to C (including those via A). How many roads are there from A to C directly?

Q21. There are three cities A, B and C, each of these cities is connected with the other two cities by at least one direct road. If a traveler wants to go from one city (origin) to another city (destination), she can do so either by traversing a road connecting the two cities directly, or by traversing two roads, the first connecting the origin to the third city and the second connecting the third city to the destination. In all there are 33 routes from A to B (including those via C). Similarly there are 23 routes from B to C (including those via A). How many roads are there from A to C directly?

Join BYJU'S Learning Program

There are 3 places in a city namely A, B and C. There are 4 routes a1, a2, a3 and a4 from A to B & there are 2 different routes, b1 and b2 from B to C. Find the number of ways he can go from place A to C via B.

The correct option is C 8(i) In the first way, he can go from A to B in 4 routes and (ii) In the second way, he can go from B to C in 2 different routes. Therefore, the total number of ways in which he can travel is 8 (4×2) routes.

There are 3 places in a city namely A, B and C. There are 4 routes a1, a2, a3 and a4 from A to B & there are 2 different routes, b1 and b2 from B to C. Find the number of ways he
can go from place A to C via B.

The correct option is C 8
(i) In the first way, he can go from A to B in 4 routes and
(ii) In the second way, he can go from B to C in 2 different routes.
Therefore, the total number of ways in which he can travel is 8 $(4 \times 2$ ) routes.