Page 268 - Services Selection Board (SSB) Interviews
P. 268

264                                                                                  Games and Tournament
            Seed 1 will play with seed 8
            Seed 2 will play with seed 7
            Seed 3 will play with seed 6
            Seed 4 will play with seed 5
            Number of matches at this stage is 8/2 =4
            Now assume that there is no upset in stage 2 then stage 3 matches will be scheduled as below:
            Stage 3 (Semifinal):
            Seed 1 will play with seed 4

            Seed 2 will play with seed 3
            Number of matches at this stage is 4/2 =2
            Then stage 4 or final match between seed 1 and seed 2.
            So total number of matches is 16/2 + 8/2 + 4/2+2/2 = 15 or in other ways since only one winner remaining 15 are
            looser and one match can give only one looser so we should have 15 matches (1 less than the total number of players).
            In this case if you look at carefully then you will find that in stage 1 sum of seed is always 17 so if I ask you seed 6 played
            with whom you just have to find 17 – 6 =11 so seed 6 played with seed 11 in stage 1.
            Round Robin Tournament: In this case each team plays with other team exactly once. Lets take an example of 6
            players namely A, B, C, D, E, F in this case we have to make a table.
                                              6
            In this case total number of matches is  C  = 15
                                                 2
                                                      st
            Lets A won against D so we will represent it in 1  row as W. The same match we can also represent as D lost against A,
                                                 th
                                       st
            and we will represent that in 1  column 4  row that shows D lost against A
                                A             B            C             D             E             F
                      A       XXXX                                       W
                      B                     XXXX
                      C                                  XXXX
                      D         L                                      XXXX
                      E                                                              XXXX
                      F                                                                           XXXX
            In this way from the given information we have to fill up the table then solve the questions based on this information.
   263   264   265   266   267   268   269   270   271   272   273