Latest TCS Aptitude Question SOLUTION: .in a certain tournament certain rules are followed: any player is eliminated the moment he losses for the third time (irrespective of how many wins he has), any player can play an

• Placement Papers
• /
• TCS
• /
• Numerical Ability
• /
• Arithmetic

TCS Question Papers: TCS Interview Experience(91) TCS Company Profile

(#M40154803) TCS Numerical Ability question Keep an EYE

.in a certain tournament certain rules are followed: any player is eliminated the moment he losses for the third time (irrespective of how many wins he has), any player can play another player any number of times. If 512 contestants enter the tournament what is the largest number of games that could be played? A)1535 b)1533 c)1536 d)1534

Asked In TCS anindita (9 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (2)   (0) Submit Your Solution Arithmetic

Read Solution (7) :

manikandan  (9 years ago)

Assume a contestant x he ll play 511 matches maximum then three times if he plays 3*511..for losing a match its 3*511+0 then 1 match 3*511+1 then for 2 matches 3*511+2 its 1535

Is this solution Helpfull? Yes (14) | No (3)  

Debarghya dutta  (8 years ago)

As there are 512 contestants , 511 contestants must be eliminated so that there can be only 1 winner.

In a single match there is only 1 loss and for elimination of a contestant he must lose 3 matches;
therefore for eliminating 511 contestants , the nos of matches required is : 511 x 3 = 1533

The last contestant i.e the winner can also lose a maximum of 2 matches.

So the maximum nos of games that could be played is 1533+2 = 1535

Is this solution Helpfull? Yes (8) | No   

kamal diwakar  (8 years ago)

what is the guarantee that the winner was lost 2 matches?
means 511*3 = 1533----> This okay.
But many say option A is correct . i.e 511*3 + 2(lost matches of the winner)= 1535.
My query is how can any one say that winner has lost 2 matches . There is a possibility that he might have won all the three matches that he/she had played.
So please any one try to crack this.

Is this solution Helpfull? Yes (1) | No   

asad ali khan  (9 years ago)

b) 1533 may be the ans.

Is this solution Helpfull? Yes | No (4)  

pk  (9 years ago)

Answer is 1535

Is this solution Helpfull? Yes | No   

bns  (9 years ago)

512*3-3=1533
because the last person cant play alone.

Is this solution Helpfull? Yes | No (1)  

Anika  (9 years ago)

pls explain the solution in more clear way

Is this solution Helpfull? Yes | No (1)  

Please Login to Read Solution.