Amy has to visit towns B and C in any order The roads connecting these towns with her home are shown...........

Quant (SSC) Time & distance

Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?

छोटे Courses बड़े Results

Master Time & distance

Prepare through Micro-courses

Try Now

Explanation:

Amy can travel clockwise or anticlockwise on the diagram.
Clockwise, she has no choice of route from A to B, a choice of one out of two routes from B to C, and a choice of one out of two routes from C back to A. This gives four possible routes.
Similarly, anticlockwise she has four different routes.
Total routes = 8

Report error

Submit Error