#DILR-15

Six cities, A through F, are connected by certain two-way roads, such that any of the six cities can be reached from any of the other cities, using these roads, either directly or after passing through some of the other cities. The following table provides partial information about the minimum number of cities that one must pass through when travelling between any pair of cities:




Q1.   DIRECTIONS for question 1: Select the correct alternative from the given choices.
Which of the following pairs of cities are directly connected?
  1. E and C
  2. D and F
  3. B and E
 a) Only (i) and (ii)    
 b) Only (ii)    
 c) Only (iii)    
 d) Only (ii) and (iii)    

Q2.   DIRECTIONS for questions 2 and 3: Type your answer in the text box provided below the question.
In how many ways can a person travel from C to D without passing through any city twice?

Q3.   DIRECTIONS for questions 2 and 3: Type your answer in the text box provided below the question.
In how many ways can a person travel from A to C without passing through any city twice?


Q4.   DIRECTIONS for question 4: Select the correct alternative from the given choices.
If two of the cities, say X and Y, which are presently not directly connected were to be connected by a new two-way road, as a result of which any city can be reached from any other city by passing through at most one city in between, which of the following pairs of cities could X and Y be?

 a) A and B    
 b) B and C    
 c) C and E    
 d) None of the above    


Solutions:-


Comments

Popular posts from this blog

#Profit&Loss-1

# DILR-1

#DILR-18