MBA Exam

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

1) 2^4 - 1
2) 2^6 + 1
3) 2^6
4) 2^4

Read Solution (Total 0)

MBA Other Question

If x <= y <= z are positive integers,x^-1 + y^-1 + z^-1 = 7/15Then x cannot be (more than one option may be correct. Mark all correct options)

1) 4
2) 5
3) 6
4) 7
5) 9
Five horses, Red, White, Grey, Black and Spotted participated in a race. As per the rules of the race, thepersons betting on the winning horse get four times the bet amount and those betting on the horse thatcame in second get thrice the bet amount. Moreover, the bet amount is returned to those betting on thehorse that came in third, and the rest lose the bet amount. Raju bets Rs. 3000, Rs. 2000 and Rs. 1000 onRed, White and Black horses respectively and ends up with no profit and no loss.1-). Which of the following cannot be true?(1) At least two horses finished before Spotted(2) Red finished last(3) There were three horses between Black and Spotted(4) There were three horses between White and Red(5) Grey came in second2-) Suppose, in addition, it is known that Grey came in fourth. Then which of the following cannot betrue?(1) Spotted came in first(2) Red finished last(3) White came in second(4) Black came in second(5) There was one horse between Black and White[CAT08][SHARE UR APPROACH TOO]

1) 1-1
2) 1-2
3) 1-3
4) 1-4
5) 1-5
6) 2-1
7) 2-2
8) 2-3
9) 2-4
10) 2-5