logo

CuriousTab

CuriousTab

Discussion


Home Verbal Reasoning Routes and Networks Comments

  • Question
  • 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?


  • Options
  • A. 8
  • B. 12
  • C. 16
  • D. 20

  • Correct Answer
  • 12 

    Explanation

    According to question ,
    It can be seen that every city is connected to all the other cities (i.e. 3 other cities).
    Step 1: Let starting point is A, there are 3 ways in which we could proceed, viz. AB, AD or AC.
    Step 2: Once we are at any of these cities (B, D or C), each one of them is connected to 3 other cities. But since we cannot go back to A the originating city, there are only 2 ways in which we could proceed from here.
    Step 3: let us assume that we are at B, we can only go to D or C by taking BD or BC respectively. From this point we a choice of either directly going back to A (thus skipping 4th city or go to 4th city and come back to A. )
    Step 4:- Now if we are at D, we can either take DA or DCA. So there are 2 more ways to go from here.
    So , total number of ways = 3 x 2 x 2 = 12 ways.


  • Routes and Networks problems


    Search Results


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

    • Options
    • A. 12
    • B. 16
    • C. 20
    • D. 22
    • Discuss
    • 2. 
      The free capacity available at the Avanti-Vaishali pipeline is

    • Options
    • A. 0
    • B. 100
    • C. 200
    • D. 300
    • Discuss
    • 3. 
      What is the free capacity available in the Avanti-Vidisha pipeline?

    • Options
    • A. 300
    • B. 200
    • C. 100
    • D. 0
    • Discuss
    • 4. 
      The quantity moved from Avanti to Vidisha is

    • Options
    • A. 200
    • B. 800
    • C. 700
    • D. 1,000
    • Discuss
    • 5. 
      A child must have had

    • Options
    • A. toys
    • B. friends
    • C. parents
    • D. education
    • Discuss
    • 6. 
      What is the maximum quantity of natural gas S can receive?

    • Options
    • A. 13 units
    • B. 15 units
    • C. 16 units
    • D. 17 units
    • Discuss
    • 7. 
      For which 2 cities it can be safely concluded that they have natural gas plants?

    • Options
    • A. M and P
    • B. M and O
    • C. P and N
    • D. M and N
    • Discuss
    • 8. 
      What is the maximum quantity of natural gas than can be transported from M to R?

    • Options
    • A. 11 units
    • B. 7 units
    • C. 9 units
    • D. 6 units
    • Discuss
    • 9. 
      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

    • Options
    • A. 5
    • B. 4
    • C. 3
    • D. 2
    • Discuss
    • 10. 
      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?

    • Options
    • A. 15
    • B. 56
    • C. 120
    • D. 336
    • Discuss


    Comments

    There are no comments.

Enter a new Comment