AITestSeriesAITestSeries
Syllabus
💼 CAT
Subject:Management Aptitude Syllabus

Logical Games & Venn Diagrams

Syllabus Unit: Logical Reasoning & Data Interpretation (LRDI)

Why it matters

Chapter overview

This cluster covers CAT LRDI's rule-based reasoning games — selecting teams under constraints, scheduling events across a calendar, mapping overlapping groups with Venn diagrams, and evaluating statements with logical connectives — all of which are solved by systematically translating stated rules into constraints, never by intuition alone.

Management Aptitude Syllabus Logical Reasoning & Data Interpretation (LRDI) 32% weightage
Live Animation1 / 4
List every valid exact-count case satisfying the condition
Compute nCr for each group within each case
Multiply group counts within each case
Sum all cases for the final total

1Team Formation & Selection

Team selection with a minimum-count condition ('at least 2 women') is solved by splitting into disjoint cases and summing, never by one direct formula.

Learning Objectives

  • Split an 'at least k of type X' selection problem into disjoint cases by exact count and sum the combinations.
  • Apply nCr for each case, ensuring the two group sizes in every case always add up to the total team size.
  • Handle 'at most k' problems similarly, by summing cases from 0 up to k instead of k up to maximum.
  • Recognise mutual exclusivity constraints (e.g. 'A and B cannot both be selected') and subtract the invalid overlap.

Key Terms

Case SplittingBreaking a selection problem with a minimum/maximum condition into separate exact-count cases, each solved independently and then summed.
At Least k ConditionA selection constraint requiring k or more of a specific type; solved by summing cases for exactly k, k+1, ..., up to the maximum possible.
Mutual Exclusion ConstraintA rule stating two specific entities cannot appear together in the same selection, handled by subtracting invalid selections from the total.
Combination Product RuleWhen selecting independently from two separate groups (e.g. men and women), the ways for each case multiply: nCr(group1) x nCr(group2).

Team formation questions with a minimum-count condition like 'at least 2 women' cannot be solved with a single combination formula — they must be split into every valid exact-count case, computed separately, and summed.

Worked example

Choose 4 from 6 men and 4 women, with at least 2 women. Valid cases: (2W,2M), (3W,1M), (4W,0M).

C(4,2)xC(6,2) + C(4,3)xC(6,1) + C(4,4)xC(6,0) = 6x15 + 4x6 + 1x1 = 90+24+1 = 115
Exam TipEach case's two group sizes must always sum to the total team size (here, 4) — a quick way to verify you haven't missed or misdefined a case.

Mutual exclusion

'A and B cannot both be on the committee' is solved as: (total selections) − (selections where both A and B are included), since it's easier to count and subtract the forbidden overlap than to enumerate every valid case directly.

Common Mistake'At most k' problems sum cases from 0 up to k, the mirror image of 'at least k' which sums from k up to the maximum — mixing up the direction is a common error under time pressure.