Solution:

I am a Garbage Truck

Solution:

   9567
+ 1085
======
 10652

Solution:

It has been clearly stated that none of the two students gave same number of correct answers which leads us to two different possibilities of correct answers:
Either (1 + 2 +3 + 4 + 5 = 15) or (0 + 1 + 2 + 3 + 4 = 10) stands true.

After analyzing the question, the maximum number of correct answers possible with the answers Gerry, Billy, Clark, Peeta and Jonathan gave:
Question 1 = 2 (b or c)
Question 2 = 2 (b or c)
Question 3= 4 (True)
Question 4 = 4 (True)
Question 5 = 3 (True)

Let us first assume with the maximum number of correct answers possible according to our data which are 15 (2+2+4+4+3). According to it, Billy must have given all correct answers as he was the only one who answered True for questions 3, 4 and 5. But in that case, Gerry and Clark must have given exactly three correct answers. Furthermore, Peeta and Jonathan must have given two correct answers. Therefore none of them got all the five correct answers which is wrong according to what we have analyzed.

Thus we move on to our next assumption according to which, the total number of correct answers are 10 (0+1+2+3+4). Now we must acknowledge that Questions 3 as well as Question 4 cannot be False as it will mean that the number of correct answers would not be 10. So the students giving wrong answers cannot be Gerry, Billy and Peeta.

Assume that Jonathan got all wrong, it will suggest that Gerry, Clark and Peeta each would have at least two correct answers. Then, Billy would have to be the person with only one correct answer and in that situation, the correct answers for questions 1 and 2 would be a and a respectively. Since that is not possible as then the total number of correct answers would be 1 (a) + 1 (a) + 1 (False) + 4 (True) + 2 (Flase) = 9.

Thus it must be Clark who has given all wrong answers. The correct answers are then b, a, True, False and False. Also, the scores are Clark (0), Billy (1), Gerry (2), Jonathan (3) and Peeta (4).

Solution:

If you are thinking to hold one chocolate from each box in hand and then balancing weight in bare hands, you are thinking all wrong.

Let us begin by labelling boxes as 1, 2, 3 and so on till 10.

Now pick one chocolate from box 1, two chocolates from box 2, three from box 3 and so on. In total, you will have 55 chocolates now. (1 + 2 + 3 + ..... + 10)

The ideal weight of the chocolates should be 55 * 20 = 1100. However, somewhere in there are the defected chocolate/s.

You can judge that clearly by noting down the result of 1100 - total weight of chocolates. If the weight is less than 1 gram, the defected box is box 1, if the weight is less than 2 grams, the defected box is box 2 and so on.

Solution:

The attached picture gives away the solution. If you can find another solution, do send us yours.

Solution:

Upon reaching each room, he found out that the window facing the dead body was closed. He had to open the window himself. This tells that there was somebody else with him who closed the window. If he would have committed suicide, at least one window would have been open.

Solution:

Sam : 2
Dean : 5
Castiel : 7

Age diff
7 - 2 = '5' is prime
7 - 5 = '2' is prime
5 - 2 = '3' is prime

Solution:

The competition was held on 11 November 2013. The logic is simple. In America, the dates are mentioned as Month/Day/Year and in Britain, dates are written as Day/Month/Year. But on 11 November 2013, the date and month will be the same. And thus both will write in the same manner i.e. 11/11/2013. If it would have been any other date, the evaluators would have been able to identify it.

Solution:

It will take the man 58 minutes to reach the top.

Since he is climbing 3 feet and falling 2 feet back every passing minute, he is actually climbing 1 feet every minute.
Therefore, he would have climbed 57 feet in 57 minutes. The remaining distance is 3 feet. He will take one more minute to climb it and reach the surface. Since he has reached the top surface, he won't slip back.

Solution:

Sansa has the siamese (conjoined) twin sister.

Solution:

Let us assume that all of them are standing on the X shore and they have to travel to the Y shore.

X = mother, first daughter, second daughter, father, first son, second son, maid and dog
Y = None

Maid and dog go first and maid returns back
X = mother, first daughter, second daughter, father, first son, second son and maid
Y = dog

Maid and first son go and maid returns with dog
X = mother, first daughter, second daughter, father, second son, maid and dog
Y = first son

Father and second son go and father returns back
X = mother, first daughter, second daughter, father, maid and dog
Y = first son and second son

Mother and father go and mother comes back
X = mother, first daughter, second daughter, maid and dog
Y = father, first son and second son

Maid and Dog go and Father returns back
X = mother, first daughter, second daughter and father
Y = first son, second son, maid and dog

Father and Mother go and mother comes back
X = mother, first daughter and second daughter
Y = father, first son, second son, maid and dog

Mother and first daughter go and maid comes back with dog
X = second daughter, maid and dog
Y = mother, first daughter, father, first son and second son

Maid and second daughter go and maid comes back
X = Maid and dog
Y = mother, first daughter, second daughter, father, first son and second son

Maid and dog go
X= none
Y = mother, first daughter, second daughter, father, first son, second son, maid and dog

Thus everyone has reached the other end.