Home » Verbal Reasoning » Routes and Networks

Find the minimum distance between H to A without visiting city E.

1200
1300
1400
None of these

Correct Answer: 1400

Explanation:

As per the given above diagram , we can see that
For minimum distance path is HGCA = 400 + 400 + 600 = 1400
Therefore , the minimum distance between H to A without visiting city E is 1400 km .

← Previous Question Next Question→

More Questions from Routes and Networks

What is the minimum distance between H to A through D?
If path H E C is taken and no city is visited twice then find the total number of such paths.
Find the maximum distance between A and H if condition is that traveling a city more than once is not allowed.
Neelam rides her bicycle from her house at A to her office at B, taking the shortest path. Then the number of possible shortest paths that she can choose is
Neelam rides her bicycle from her house at A to her club at C, via B taking the shortest path. Then the number of possible shortest paths that she can choose is
Which of the following is true?
Which nodes should be selected for installation of surveillance cameras?
If a new path is constructed from T7 to Y then find the total number of paths from X to Y?
Which one of the following could be the value of toll taxes at T1, T2, T3…............... T8 such that total cost of travel is same irrespective of route?
What is the difference between maximum amount and minimum amount that Mr. Ricky can spend on a day if he wants to travel from his home (X) to office (Y) if toll tax at each toll booth is Rs 50?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion