 Related Questions 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 Read Answers (7) | Asked by : rituparna das CTS PAPER & INTERVIEW EXPERIENCE – 21st OCTOBER, 2006 - KOLKATASUBMITTED BY: ARINDAM SARKAR, KOLKATA CTS PAPER & INTERVIEW EXPERIENCE – 21st OCTOBER, 2006 - KOLKATASUBMITTED BY: ARINDAM SARKAR, KOLKATA (arindam.ece@gmail.com) TOTAL CANDIDATES APPEARED FOR THE WRITTEN TEST: 2500SHORT LISTED CANDIDATES FOR INTERVIEW: 776SHORTLISTED CANDIDATES TO BECOME A PART OF COGNIZANT:207Total 60 minutes, No Negative marks Verbal Ability Read Answers (12) | Asked by : Arinda Sarkar There are 9 cities numbered 1 to 9. From how many cities the flight can start so as to reach the city 8 either directly or indirectly such the path formed is divisible by 3. Latest Answer : 9 cities.1 - 8 (1+8 = 9)2-5-8(2+5+8=15)3-4-84-(3 or 6)-85-2-86-(4 or 1)-87-88-2-89-1-8 ...
Sponsored Links
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
