Home » Verbal Reasoning » Routes and Networks

If path H E C is taken and no city is visited twice then find the total number of such paths.

Q: If path H E C is taken and no city is visited twice then find the total number of such paths.

From solution of question number 26 , Starting from HEC: HECGBA, HECBA, HECA, HECDA (Total 4 paths) Hence , the total number of such paths is 4 .

3
4
5
None of these

Correct Answer: 4

Explanation:

From solution of question number 26 ,
Starting from HEC: HECGBA, HECBA, HECA, HECDA (Total 4 paths)
Hence , the total number of such paths is 4 .

← Previous Question Next Question→

More Questions from Routes and Networks

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?
If toll tax is devised in such a way that total cost of travel remains same irrespective of the path then what is the minimum cost of travel from X to Y?
If toll tax at all of the toll booths is same and is devised such that the ratio of maximum cost to minimum cost of travel from X to Y is 28 : 19 then which one of the following is the cost of travel from X to Y through toll Both T3?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion