• recategorized by
1,147 views
1 1 vote

Five cities P, Q, R, S, T are connected by different modes of transport as follows:

  • P and Q connected by boat as well as rail.
  • S and R connected by bus and boat.
  • Q and  T connected by air only.
  • P and  R connected by boat only.
  • T and R connected by rail and bus.

If a person visits each of the places starting from P and gets back to P which of the following places must he visit twice?

  1. P
  2. Q
  3. R
  4. T

1 Answer

0 0 votes
From the information given, we find that the cities P, Q, R, S, T  are connected as follows:
$\begin{array}{lcr} P \Leftarrow & \Rightarrow R \Leftarrow & \Rightarrow S \\ \Uparrow & \Uparrow  & \\ \Downarrow & \Downarrow & \\ Q \Leftarrow & \Rightarrow T & \end{array}$
To go to S back to P, R must be visited twice.
Answer:
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
1.3k
1.3k views
Applied Course asked Jan 16, 2019
1,281 views
Naveen invited seven of his friends to a party. At the party, several pairs of people shook hands, although no one shook hands with themselves or shook hands with the sam...
1 1 vote
1 1 answer
1.5k
1.5k views
Applied Course asked Jan 16, 2019
1,528 views
The project of building $20$ roads connecting $9$ cities is under way, as outlined above. So far, only some of the $20$ roads are constructed, and the digit on each city ...
64 64 votes
7 answers 7 answers
36.0k
36.0k views
Arjun asked Feb 7, 2019
35,956 views
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...
8 8 votes
3 answers 3 answers
15.7k
15.7k views
Arjun asked Apr 22, 2018
15,721 views
The number of edges in a regular graph of degree: $d$ and $n$ vertices is:maximum of $n$ and $d$ $n +d$$nd$$nd/2$