A huge gathering of people decided to have a great picnic. They organized wagons, and each wagon was carrying fixed number of passengers. On the way, 10 wagons broke down and each wagon has to carry one more extra men. On the return trip, 15 more wagons went out of commission so the remaining had to carry three more than in starting journey.
So, how many people attended the great annual picnic?
Let w be the number of wagons and p be the people in a single wagon in initial journey.
We know that
wp = (w-10)(p+1) = (w-25)(p+3)
A car has four tyres A, B, C and D and a spare tyre S. Each tyre can move a maximum distance of 20000 Kms.
What is the maximum distance the car can travel?
Assume that you can swap the tyres as and when required.
Have you already solved it ? Congratulations !!
If not, let us be your guide.
The answer is 25000 Kms. Let’s see how…
In your cellar there are three light switches in the OFF position. Each switch controls one of three light bulbs on floor above.
You may move any of the switches but you may only go upstairs to inspect the bulbs.
When upstairs, you cannot access the switches. What is the minimum number of times you need to go upstairs to determine the switch for each bulb?
Turn light switch 1 to the ON position for a few minutes, then turn it off. Then turn on switch 2, and go upstairs. The light bulb that is off and hot is attached…
How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started?
Case 1 : Answer is a function of N. Output it with N with multipliers or divisor numbers following N. For example, N * 2, N / 2, N * 3 / 4.
Case 2 : Answer is a integer. Just put the number without any decimal places if its an integer. If the answer is Infinity, output Infinity.
Case 3 : Floating point number. Round it off to 2 decimal places…
You are on a spaceship that has a computer with n processors.
Suddenly, the spaceship gets hit with an alien laser beam, and some of the processors are damaged.
However, you know that more than half of the processors are still good.
You can ask one processor whether it thinks another processor is good or bad. A good processor will always tell the truth, but a bad one will always lie.
A ‘step’ consists of asking one processor if it thinks another processor is good or bad. Find minimum number of steps required to find at least one good processor.