Answer / chris uzdavinis

Taking the worst case scenario, the minimum number of
iterations required is 20. Here is why:

For N drops you can cover a range of the sum(1,..N), which
is n*(n+1) / 2.

If we have 200 potential heights to test, we solve n*(n+1) =
400, and using the quadratic equation gives us
19.5062490237426, rounding up to 20.

The sequence of tests would be drop at heights of:
20
39
57
74
90
105
119
132
144
155
165
174
182
189
195
200

(Notice, the distance between each level decreases by 1 to
account for the extra drop it took to get there.)

If the bulb does not break on a level, try the next higher
number in the above sequence. If it does break, then do a
linear search starting at the previous "level", plus 1.

Any answer that partitions segments into equal lengths will
be suboptimal.

Answer / ram kumar.y

make the stack into 14 sections such that 10 of them will
have 14 blocks each and rest of the 4 will have 15 blocks
each.i.e., 14*10+15*4=140+60=200 blocks.
coming from the bottom keep dropping the bulb from the
highest blocks in each sections. in the worst case scenario,
the bulb may break in last(14th) section.
with the second bulb, keep dropping the bulb from any one
end of that section(in this case 14th as its the worst case)
which has 15 blocks and the first bulb has been dropped from
one of the 15 blocks. so, it takes 14 more chances(at a
worst case) to find out the block from where the bulb breaks
when dropped. So, the total no. of iterations are 14+14=28(max).

Answer / shantanu_sanjeev

For the best solution the worst case max drops will be "24"

For this we divide it into
1st five blocks from bottom of size 20 : 5*20 = 100
Next ten blocks of top of size 10 : 10*10 = 100

This will have a worst case at 99 when there will be 24
drops and all other numbers above 99 will have less than 24
drops.

Answer / magnum

in the question it is asked "THE HEIGHT AT WHICH BULB BREAKS"
not the height from which u drop so the bulb breaks.so from whatever height u may drop, the bulb if it breaks,it will break only on the ground i.e. 0 feet.

Answer / md

200 feet is the max height.
Means bulb can break from any feet within the max limit.

In the worst case, no of iteration will be 200.

To make situation better.. lets segmentise the 200 feet in
X segments.
Then will experiment with one bulb from top of each
segments. Bulb may break at any trial. worst case bulb
breaks at last trial. iteration = X

Now need to find the exact feet among the particular
segment. This segment has 200/X feet span.

Hence Worst case : iteration I = X + (200/X)

Now the job is to find out value of X so that I is minimum.

X=10 or X=20 in worst case min no of iteration is 30

Answer / nikky

question is not clear!!!

Answer / chris uzdavinis

Minor typo in previous answer (#7): it should say ... we
solve n*(n+1) = 200

To help get the mindset of the answer, think of the question
differently at first. Rather than solve for the fewest
number of drops to cover a range, think about a twisted
version of that question: "given a fixed number of drops,
what range can be completely covered?"

Our constraints are we have two bulbs, and we're done once
the 2nd breaks, but if it doesn't break we can use it again.

Given only 1 drop, we can only cover a range of 1. Either
it breaks or it doesn't. (If we go higher than the first
level, we don't know if it would have broken at a lower level.)

Given 2 drops, we can cover a range of 3: first drop on 2,
if it breaks, try 1, if not, try 3.

Given 3 drops, we cover a range 1..6: First drop on 3, if
it breaks, try 1, then 2. If it doesn't break, drop #2 is
on 5. If breaks, try 4. If not, try 6.

Given 4 drops, we cover a range of 1..10:
Start on 4, if breaks, try 1,2,3. If not, try 7. If
breaks, try 5,6. If not, try 9. If breaks, try 8. If not
try 10.

And so on. Thus, for N drops, we start on level N. If it
breaks, start a linear search using the remaining bulb, from
1..N-1. Thus, it took a max of 20 drops. But if it doesn't
break, we try level N+(N-1). If it breaks, start a linear
search from N+1. Otherwise try N+(N-1)+(N-2). etc.

This series is clearly the sum from 1 to N drops.

So now that we know how big of a range we can cover given a
fixed number of drops. But the original question asks us to
cover a range of 200, and find the number of drops required.
We just find the smallest integral value for N such that
sum of 1..N >= 200, which is 20.

I gave the sequence of tests in the previous post.

Answer / vineeta agarwal

Max height = 200 feet
no of bulbs we have=2
in minimum iteration we need to find the height at which bulb will break...
i think we can find only range... not exact height...
first will divide 200/2=100 feet
we drop bulb from 100 feet if 1st bulb break than we have to find height from 0 to 100 feet.... than we drop 2nd bulb from 50 feet if break than our range is 0-50 else we do same thing from 75 feet..... just like that we do and will find the range....

Answer / viral avalani

No. of iterations will be minimum at height of 200 ft.

Answer / rajendra varma

100ft

In a certain year, the number of girls who graduated from City High School was twice the number of boys. If 3/4 of the girls and 5/6 of the boys went to college immediately after graduation, what fraction of the graduates that year went to college immediately after graduation?

1 Answers   ICICI,

There are 2 items combined cost is 110.. one item cost is 100 rupees more than the cost of other. So tell me indiviual cost of items......

10 Answers   Siemens,

A cube is divided into 125 pieces.. then four columns are removed then coloured all side black.. i) how many 0 side painted cubes? ii) how many 1 side painted cubes? iii) how many 2 side painted cubes? iV) how many 3 side painted cubes? V) how many 4 side painted cubes?

7 Answers   Stairway Engineering, Tata Elxsi,

A group of friends went on a holiday to a hill station. It rained for 13 days. But when it rained in the morning, the afternoon was lovely. And when it rained in the afternoon, the day was preceded by clear morning. Altogether there were 11 very nice mornings and 12 very nice afternoons. How many days did their holiday last?

3 Answers   Zoho,

There is a family party consisting of two fathers, two mothers, two sons, one father-in-law, one mother-in-law, one daughter-in-law, one grandfather, one grandmother and one grandson. What is the minimum number of persons required so that this is possible?

1 Answers  

1.At the recent web developres bowling match,two ganes were played.Kiev beat stuart in both games;also Richard beat John in both games.The winner in game1 second in game2.Richard won game2 and John beat stuart in game1.No player got the same placing twice.Can you determine who finished where in each game?

2 Answers   QA,

in a family there are 5 members viz. parents and 3 children. the member are A,B,C,D AND E out of which 2 are males and 3 are females. A has 3 childerns, 2 daughters and 1 son. c in B's son. A in D's father. 1.how is E related to B? 2.who is D's mother? give me solution plese.

2 Answers  

how do i improve my logical questions. is there any website?

1 Answers  

3 blocks are chosen randomly on a chessboard. What is the probability that they are in the same diagonal?

3 Answers  

Nine plates of similar in design... same colour, same size but one plate among that has very small difference in weight. you should find it but the condition is u can use weighing pan only two times. at the second time u should be able to find the defeated plate..............

6 Answers  

Two planes take off at the same exact moment. They are flying across the Atlantic. One leaves New York and is flying to Paris at 500 miles per hour. The other leaves Paris and is flying to New York at only 450 miles per hour ( because of a strong head wind ). Which one will be closer to Paris when they meet?

18 Answers  

There is a number that is 5 times the sum of its digits. What is this number? Answer is not 0.

2 Answers   MasterMind,