Multiple Choice Questions on Amy has to visit towns B and C in any order The roads connecting these towns with her home are shown........... for Mathematics - All Exams Preparation

Time & distance

Quant (SSC)

Title

45:30

Video Progress

8 of 24 completed

Notes Progress

5 of 15 completed

MCQs Progress

38 of 100 completed

Subjective Progress

8 of 20 completed

Continue to Next Topic

Indian Economy - Understanding the basics of Indian economic system

Next Topic

    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?

    6

    Incorrect Answer

    5

    Incorrect Answer

    7

    Incorrect Answer

    8

    Correct Answer
    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


    ProfileResources

    Download Abhipedia Android App

    Access to prime resources

    Downlod from playstore
    download android app download android app for free