mitruka.abhishek
BAN USER
Comments (4)
Reputation 90
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Awesome answer!!
- mitruka.abhishek October 10, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
@Sandeep, your logic is wrong, I agree that for 128 players there will be 7 rounds but there will be 127 matches : 64 in first, 32 in second, 16 in third, 8 in fourth, 4 in fifth, 2 in sixth and 1 in seventh round.
You can see the question in this way as well : if a coin is rejected that it can not be the lightest one, it must have been weighted against atleast one coin lighter than itself.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Its n-1.
Assume there are n players in a tennis singles tournament having the rule that as soon as someone loses a match, he is out. Now to find a winner, n-1 players must lose a match. Now see the analogy between this example and the question
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Prob. of actually defective = prob of defective / (prob of defective + prob of good misidentified as defective)
- mitruka.abhishek July 29, 2013prob of good misidentified as defective = prob of good * 2 / 100
= 0.006 / (0.006 + 0.994 * 0.02) = 0.006 / (0.006 + 0.01988)
= 0.232