Latest CTS Aptitude Question SOLUTION: There are 6 cities, of which each is connected to every other city. How many different routes can one trace from A to B, such that no city is touched more than once in any one rout

• Placement Papers
• /
• CTS
• /
• Numerical Ability
• /
• Permutation and Combination

CTS Question Papers: CTS Interview Experience(3) CTS Company Profile

(#M40007333) CTS Numerical Ability question Number problem Keep an EYE

There are 6 cities, of which each is connected to every other city. How many different routes can one trace from A to B, such that no city is touched more than once in any one route

a) 48 b) 60 c) 65 d) 72

Asked In CTS (12 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (17)   (6) Submit Your Solution Permutation and Combination