You open your CAT mock, hit the DILR section, and there it is \u2014 a set describing a round-robin football league or a knockout badminton tournament, with five conditions and a half-filled points table staring back at you. Most aspirants freeze for a full minute before even attempting the first question, and that one minute of hesitation is usually the difference between clearing the sectional cutoff and missing it.<\/p>\n\n\n\n
Games and tournaments questions for CAT aren’t rare outliers\u2014they appear almost every other year, and when they do, they are often tougher than the average DILR set. This guide explains exactly how these questions work, provides a repeatable framework for solving them under time pressure, and walks you through solved practice questions so you stop treating tournament sets as the section to skip.<\/p>\n\n\n\n
The Data Interpretation and Logical Reasoning (DILR) section of CAT typically presents four sets, and candidates usually need to attempt two to three within the allotted time. Games and tournaments sets have a habit of appearing among the harder sets in a slot, which means they often separate strong scorers from average ones rather than acting as an easy pick.<\/p>\n\n\n\n
Here’s how frequently this pattern has shown up in recent CAT papers, based on publicly discussed exam analyses from past years:<\/p>\n\n\n\n Pattern data comes from publicly available analyses of past CAT papers. Set difficulty can vary by slot and candidate perception, so use this as a directional trend rather than a guarantee for any specific upcoming attempt.<\/em><\/p>\n\n\n\n Even in years without a dedicated tournament set, question-writers frequently borrow tournament-style logic \u2014 points tables, win\/loss\/draw conditions, seeding \u2014 inside broader arrangement or ranking sets. That’s exactly why building a solid framework for CAT DILR games and tournaments pays off even if the exact topic doesn’t repeat verbatim.rrow tournament-style logic \u2014 points tables, win\/loss\/draw conditions, seeding \u2014 inside broader arrangement or ranking sets. That’s exactly why building a solid framework for CAT DILR games and tournaments pays off even if the exact topic doesn’t repeat verbatim.<\/p>\n\n\n\n At their core, these sets use logical reasoning built around a competitive structure\u2014a sports league, knockout bracket, quiz contest, or point-scoring game. You get partial information and reconstruct the missing pieces through logical deduction rather than calculation.<\/p>\n\n\n\n Unlike pure Data Interpretation sets (which usually hand you complete data to analyse), games and tournaments questions for CAT deliberately withhold information. Your job is to fill gaps using elimination, not extraction.<\/p>\n\n\n\n The biggest mistake candidates make is reading all the conditions first and only then starting to draw a table. Reverse that order.<\/p>\n\n\n\n Skim the first two lines only. Is it round-robin, knockout, or a hybrid? This single decision tells you what your base table should look like before you invest time in the details.<\/p>\n\n\n\n For a round-robin set with n teams, sketch an n\u00d7n grid, since every team plays every other team exactly once. For a knockout set, sketch the bracket structure first \u2014 this visual alone often resolves 20\u201330% of the conditions instantly, since bracket position constrains who can play whom.<\/p>\n\n\n\n Don’t read all conditions and then start filling \u2014 fill as you go. Use consistent symbols: a tick for a win, a cross for a loss, and a question mark for unresolved outcomes. This keeps your notes aligned with the question numbers and makes later review easier.<\/p>\n\n\n\n Most tournament sets hinge on total points, and total points are usually a fixed, calculable number once you know the number of matches and the scoring rule. For example, in a round-robin format with 3 points for a win and 0 for a loss (no draws), the total points distributed always equals 3 \u00d7 (total matches). Anchoring to this total lets you cross-check partial tables fast.<\/p>\n\n\n\n Every DILR set has at least one question that needs minimal deduction \u2014 often the first one. Solve that first to build table confidence before tackling questions that need the full logical chain.rst one. Solve that first to build table confidence before tackling questions that need the full logical chain.<\/p>\n\n\n\n Set:<\/strong> Four teams \u2014 P, Q, R, S \u2014 play a round-robin football tournament where every team plays every other team exactly once. A win earns 3 points, a draw earns 1 point each, and a loss earns 0 points. No match ended in a draw. After all matches:<\/p>\n\n\n\n Question:<\/strong> How many total points were distributed across all four teams?<\/p>\n\n\n\n Solution:<\/strong> With 4 teams in a round-robin, total matches = 4C2 = 6. Since no match was a draw, every match distributes exactly 3 points to the winner. Total points = 6 \u00d7 3 = 18 points<\/strong>.<\/p>\n\n\n\n Question:<\/strong> What was Q’s final point tally?<\/p>\n\n\n\n Solution:<\/strong> Q lost only to P, meaning Q won its matches against R and S. That’s 2 wins \u00d7 3 points = 6 points<\/strong>.<\/p>\n\n\n\n This is exactly the kind of question where anchoring to the total-points formula in Step 4 above saves you from manually tracing every match.<\/p>\n\n\n\n Set:<\/strong> Eight players enter a knockout badminton tournament. Players are seeded 1 to 8, and in each round, the higher seed (lower number) is more likely to win, but upsets are possible. It is known that Seed 3 lost in the quarterfinal to a player who was later defeated in the final.<\/p>\n\n\n\n Question:<\/strong> How many total matches were played in the entire tournament?<\/p>\n\n\n\n Solution:<\/strong> In a single-elimination knockout with 8 players, exactly one player is eliminated per match, and 7 players must be eliminated to leave one winner. Total matches = 7<\/strong>.<\/p>\n\n\n\n This “one loser per match” shortcut works for any knockout bracket, regardless of size \u2014 a 16-player bracket always has exactly 15 matches, a 32-player bracket always has 31.<\/p>\n\n\n\n Set:<\/strong> Five teams \u2014 A, B, C, D, E \u2014 play a round-robin cricket tournament (every team plays every other team exactly once). A win earns 2 points, a tie earns 1 point each, and a loss earns 0 points. The partially filled points table after all matches shows: A scored 6 points, B scored 5 points, C scored 4 points, and E scored 2 points. There was exactly one tied match in the entire tournament.<\/p>\n\n\n\n Question:<\/strong> How many points did D score?<\/p>\n\n\n\n Solution:<\/strong> Total matches in a 5-team round-robin = 5C2 = 10. With exactly one tie, that tie distributes 1+1 = 2 points, and the remaining 9 decisive matches distribute 2 points each = 18 points. Total points = 2 + 18 = 20. Known totals: A(6) + B(5) + C(4) + E(2) = 17. So D = 20 \u2212 17 = 3 points<\/strong>.<\/p>\n\n\n\n Question:<\/strong> Is it possible for D to have won exactly one match and tied one match? Solution:<\/strong> A win + a tie = 2 + 1 = 3 points, which matches D’s tally exactly, so yes, this is a valid combination<\/strong> for D’s score of 3 \u2014 though it isn’t the only one, since D could also have won 1 match, lost 3, and had zero ties (2 points, which doesn’t fit) or other splits that sum to 3. The win-plus-tie combination is confirmed consistent with the given total, but not provably unique without more conditions.<\/p>\n\n\n\n This set demonstrates why the total-points formula must always be adjusted for ties before you compare it against the individual scores you’re given.<\/p>\n\n\n\n Set:<\/strong> Eight teams are divided into two groups of four (Group X and Group Y) for a round-robin group stage. The top 2 teams from each group advance to a single-elimination knockout semifinal stage, followed by a final.<\/p>\n\n\n\n Question:<\/strong> How many total matches are played across the entire tournament (group stage + knockout stage)?<\/p>\n\n\n\n Solution:<\/strong> Each group of 4 plays a round-robin: 4C2 = 6 matches per group, so 2 groups = 12 group-stage matches. Four teams advance to the knockout stage (semifinals + final), which by the “one loser per match” shortcut means 4 \u2212 1 = 3 knockout matches. Total = 12 + 3 = 15 matches<\/strong>.<\/p>\n\n\n\n This hybrid format is a favourite in CAT DILR precisely because it forces you to treat the two stages as separate mini-problems rather than one continuous structure \u2014 mixing group-stage points with knockout progression is the single most common error candidates make here.<\/p>\n\n\n\n Try these five questions on your own using the frameworks above before checking the answer key at the end. Time yourself\u2014aim to finish all five in under 10 minutes, as they test quick recall rather than full DILR solving.<\/p>\n\n\n\n Answer Key:<\/strong><\/p>\n\n\n\n Want a longer practice run? We\u2019ve compiled a free downloadable practice set<\/mark><\/strong> covering all four formats discussed above \u2014 round-robin, knockout, points table, and hybrid tournaments<\/mark><\/strong> \u2014 with 15 additional original questions and step-by-step solutions<\/mark><\/strong>.<\/p>\n\n\n\nCAT Year<\/th> Games\/Tournaments Set Featured<\/th> Difficulty Level<\/th> Format<\/th><\/tr><\/thead> CAT 2019<\/td> Two separate tournament-based sets<\/td> High<\/td> Round-robin & knockout mix<\/td><\/tr> CAT 2021<\/td> League table completion set<\/td> Moderate-High<\/td> Round-robin (soccer league)<\/td><\/tr> CAT 2022<\/td> Team rankings and results set<\/td> High<\/td> Points-based tournament<\/td><\/tr> CAT 2023<\/td> Tournament-style reasoning set<\/td> Moderate-High<\/td> Mixed scoring format<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n What Are CAT Games and Tournaments Questions, Exactly?<\/h2>\n\n\n\n
Common Formats You’ll Encounter<\/h3>\n\n\n\n
Format Type<\/th> What It Tests<\/th> Typical Complexity<\/th><\/tr><\/thead> Round-robin league<\/td> Every team plays every other team once; you reconstruct win\/loss\/draw records and points<\/td> Moderate to High<\/td><\/tr> Knockout tournament<\/td> Single-elimination bracket; you trace who played whom and progression logic<\/td> Moderate<\/td><\/tr> Points-table completion<\/td> A partially filled table with a scoring rule (e.g., 3 for a win, 1 for a draw) that you complete<\/td> High<\/td><\/tr> Group + knockout hybrid<\/td> Teams first play in groups (round-robin), then top finishers proceed to a knockout stage<\/td> High<\/td><\/tr> Individual game\/quiz rounds<\/td> Players accumulate points across rounds based on performance rules, not team matches<\/td> Moderate<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n Step-by-Step Framework to Solve Games and Tournaments Sets<\/h2>\n\n\n\n
Step 1: Identify the Format Before Reading Conditions<\/h3>\n\n\n\n
Step 2: Build the Skeleton Table Immediately<\/h3>\n\n\n\n
Step 3: Translate Every Condition Into the Table as You Read<\/h3>\n\n\n\n
Step 4: Exploit the Scoring Rule Early<\/h3>\n\n\n\n
Step 5: Attempt the Direct-Retrieval Question First<\/h3>\n\n\n\n
Solved Practice Question: Round-Robin Format<\/h2>\n\n\n\n
\n
Solved Practice Question: Knockout Format<\/h2>\n\n\n\n
Solved Practice Question: Points-Table Completion<\/h2>\n\n\n\n
Solved Practice Question: Hybrid Group + Knockout Format<\/h2>\n\n\n\n
Practice Questions: Test Your Tournament Skills<\/h2>\n\n\n\n
\n
\n