I am an eight letter word and I am a computer terminology.
The second, third and fourth letters make an animal.
The fourth, fifth, sixth, seventh and eighth letters make a weapon.
The first, second, third and fourth letters can be taken as an outcome of any exam.
The fifth, sixth, seventh and eighth letter combine to form a high end typing software.
People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?
If two fifty-foot ropes are suspended from a forty-foot ceiling that is twenty feet apart, how much rope will you be able to steal if you have a knife?
There was a blind beggar living on the footpath of a street. Suddenly one day, the beggar's brother died. What was the relation of the blind beggar with the person who died?
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki
