The below mentioned letters have been placed in a order using a logic.

DEAD, BALL, FEAR, SHOP

Can you find the logic?

I am working in a bus company. The company recently went under expansion and therefore there was not enough room for all the buses. As a result, twelve buses had to be stored outside.

If the company decides to expand the garage space by forty percent, enough space to accommodate the current buses will be created leaving enough space for twelve more buses if the need arises in future.

Can you calculate the number of buses that the company owns at present?

A high school has a strange principal. On the first day, he has his students perform an odd opening day ceremony:

There are one thousand lockers and one thousand students in the school. The principal asks the first student to go to every locker and open it. Then he has the second student go to every second locker and close it. The third goes to every third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth student does this to every fourth locker, and so on. After the process is completed with the thousandth student, how many lockers are open?

Find the last number in the series below:

voN luJ yaM raM ---

Solve below rebus puzzle?

You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

It is a 5 letter word if you take away first letter it is something you get from sun, if you remove second letter you will get something to eat, if you remove third letter you get a word you use in pointing at and if you remove the fourth letter you get something to drink. What is it?

A man embarked on a questionnaire game. He kept asking the same question to whomever he found. The answer each time was different.

Can you guess what the question was?

I am under you when I am whole.
I shift above you if you remove the first letter.
I come all around you if you remove the second as well.

Can you tell me who I am?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?