Solution:

The mules is moving in circular path and hence outside legs travels more distance than inner legs.

Solution:

The last marble will be yellow.

Since marbles can only be taken out in pairs and you started off with an odd number of yellows there is always going to be one yellow left over that you'll keep putting back in the box until it's left on it's own.

Solution:

Since each one of them gave one answer wrong, this means that each one of them gave two answers right.

Let us assume that Student A gave a wrong answer to the first question. This will mean that Student B also gave a wrong answer for the first. This will conclude that the rest of the two answers given by them are correct. However, the answers are different and thus it is not possible.

Thus both Student A and Student B must be right with the first question and the answer to the first is two.

If you keep applying the same logic, you will come to a conclusion that following are the correct answers:
Q1. Two
Q2. Three
Q3. Two

Solution:

Michelangelo juggles the diamonds across while crossing the bridge.

Solution:

The mules is moving in circular path and hence outside legs travels more distance than inner legs.

Solution:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

5 leopard and one sheep

since all animal are rational , once 1st leopard eats the sheep all the rest of leopard would know about this.

Solution:

The Password.

Explanation:
Clues 2 and 5 are correct and rest are lies.

Solution:

2100 miles.

Each vowel equivalent to 500 and each consonant equivalent to -200

Solution:

1/2

one of two is the possibility
1. If any of the first 99 people sit in Abhishek seat, Abhishek will not get to sit in his own seat.
2. If any of the first 99 people sit in Aishwarya's seat, Abhishek will get to sit in his seat.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.