Can you find out which options fits best with the missing column?

What number do you get when you multiply all of the numbers on a telephone's number pad?

You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.

A dead body is found outside a multi-story multinational company. The case is reported and a homicide detective is called on the crime scene.

He looks at the body and then towards the building. From the position of the body, it is evident that the victim committed suicide. He goes to the first floor of the building and then walks in the direction of the dead body, opens the window and toss a coin in the air.

He goes to second floor and again repeats the process. He keeps doing this till he is done on all the floors. Then he returns back to the floor and tells his team that it is a murder.

How in heaven did he deduce that?

What does this rebus means ?

PROG WORKRESS

There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.

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

DEAD, BALL, FEAR, SHOP

Can you find the logic?

using four eights (8) and a one (1) and one mathematical symbol , create the number 100

John is looking at Jenifer, but Jenifer is looking at Jacob. John is married, but Jacob is not.

Is a married person looking at an unmarried person ?

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?