Solution:

Starting with the first two words, Take the first and last letters, reading from left to right. Example: Carrot fiascO "from these pairs" the message is as follows:

CONGRATULATIONS CODE BREAKER

Solution:

Solution is shown in image below

Solution:

Take 10 number of cards in a new deck and change their face direction. For example- You create a new deck of 10 cards and out of 10, 3 faces up in the new deck. So remaining 7 faces up are in the old deck. But hey! while creating the new deck you reversed the face direction of new cards. So actually the 3 cards which were facing up are actually face down in the new deck while 7 faces up.

Solution:

This statement is true but only in a specific case i.e. if both of the siblings continue to live till the day the younger is as old as the elder one was during the time of their birth.

Solution:

4

No Of circles in the number.

Solution:

19

Explanation:
The children can purchase 19 chocolates in return.

Out of 77 wrappers, 75 will be used to buy 15 chocolates and two will be left spare.
The 15 chocolates will create 15 empty wrappers that can be exchanged to get three chocolates.
Three chocolates will return three wrappers which will help them buy another chocolate.
Now the wrapper from this chocolate and the two spare that were left earlier will get them another chocolate.
15 + 3 + 1 = 19

Solution:

40 balls

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:

On Your lap.

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.