Q.Draw a knock-out fixture for 11 teams and calculate the number of matches, the number of byes, and the distribution of byes in the upper and lower halves.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →11 teams, knock-out. Matches = N - 1 = 10. Byes = 16 - 11 = 5.
Upper half = 6 teams (T1–T6) with 2 byes (T1, T6); Lower half = 5 teams (T7–T11) with 3 byes (T11, T7, T10).
Round I has just 3 matches; the fixture then runs 4 → 2 → 1 to the Final.
Concept understanding — why a knock-out needs byes
In a knock-out (elimination) tournament every match eliminates exactly one team. To leave one champion out of N entrants, exactly N-1 teams must be eliminated, so exactly N-1 matches are played. That is why the matches formula needs no drawing at all — it is pure counting.
The bracket, however, halves at every round: 16 → 8 → 4 → 2 → 1. It only works cleanly when the number of teams is a power of 2. When N is not a power of 2, we top the draw up to the next power of 2 by giving some teams a bye — a free pass into Round II without playing Round I.
For N teams in a knock-out tournament:
- Total number of matches = N - 1
- Number of byes = (next higher power of 2) - N (powers of 2: 2, 4, 8, 16, 32, 64 …)
- If N is itself a power of 2, there are no byes.
- When N is odd: Upper half = (N+1)/2 teams, Lower half = (N-1)/2 teams.
- When N is even: each half = N/2 teams.
Here N = 11 (teams), and the answers come out in teams, byes and matches — all pure counts, no units.
Step-by-step calculation
-
Number of matches
Matches = N - 1 = 11 - 1 = 10
-
Number of byes — the powers of 2 are 2, 4, 8, 16, 32 …; the next higher power of 2 above 11 is 16.
Byes = 16 - 11 = 5
-
Division into halves (11 is odd)
Upper half = (N+1)/2 = (11+1)/2 = 6 teams (Teams 1–6)
Lower half = (N-1)/2 = (11-1)/2 = 5 teams (Teams 7–11)
-
Distribution of the 5 byes — byes are allotted in the fixed order: last team of the lower half → first team of the upper half → last team of the upper half → first team of the lower half, and then the sequence repeats inwards.
Bye # Goes to Which team Half 1st Last team of the lower half Team 11 Lower 2nd First team of the upper half Team 1 Upper 3rd Last team of the upper half Team 6 Upper 4th First team of the lower half Team 7 Lower 5th Next (second-last) of the lower half Team 10 Lower Upper half: 2 byes (T1, T6) Lower half: 3 byes (T11, T7, T10)
-
Round-I matches — 5 teams sit out, so the teams actually playing Round I are 11 - 5 = 6, i.e. 6 ÷ 2 = 3 matches.
The fixture
Round I — 3 matches (teams with a bye marked bye)
| Half | Team | Round I |
|---|---|---|
| Upper (6 teams) | Team 1 | bye |
| Team 2 | M1: T2 v T3 | |
| Team 3 | M1 | |
| Team 4 | M2: T4 v T5 | |
| Team 5 | M2 | |
| Team 6 | bye | |
| Lower (5 teams) | Team 7 | bye |
| Team 8 | M3: T8 v T9 | |
| Team 9 | M3 | |
| Team 10 | bye | |
| Team 11 | bye |
The full bracket (Round I through the final) is shown below. Each half now has 4 teams (a clean power of 2), so the draw runs 4 → 2 → 1 to the final: …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.