Free CAT library

CAT Grouping & Distribution: Concepts and Formulas

3 concepts for CAT Grouping & Distribution (DILR), from basics to CAT-level shortcuts.

  1. Concepts & Solved Examples
    Master the architectural principles of Grouping, Selection, Multi-Attribute Matching Matrices, and Capacity-Constrained Partitioning in CAT DILR. Formulate propositional selection logic (mutually…
  2. Practice Exercise 1 (47 Questions)
    47 comprehensive practice questions on grouping, team selection, multi-attribute distribution, schedules, and matrix allocation.
  3. Practice Exercise 2 (43 Questions)
    Practice Exercise 2 of Chapter 23 (Grouping & Distribution) delivers 43 advanced, authentic CAT-level constraint satisfaction and combinatorial allocation problem sets. The exercise focuses on…

Key formulas

Propositional Selection Inequality

xA≤xB  ⟺  A  ⟹  B,xA+xB≤1  ⟺  ¬(A∧B),xA=xB  ⟺  A  ⟺  Bx_A \le x_B \iff A \implies B, \quad x_A + x_B \le 1 \iff \neg(A \land B), \quad x_A = x_B \iff A \iff B

Translates verbal conditional selection statements into linear 0-1 integer inequalities. Implication imposes an upper bound, mutual exclusion caps the sum at 1, and tied pairs enforce equality.
Capacity-Constrained Extremal Bounds

∣Gi∣min⁡=max⁡(Li,  N−∑j≠iUj),∣Gi∣max⁡=min⁡(Ui,  N−∑j≠iLj)|G_i|_{\min} = \max\left(L_i, \; N - \sum_{j \ne i} U_j\right), \quad |G_i|_{\max} = \min\left(U_i, \; N - \sum_{j \ne i} L_j\right)

Computes the exact lower and upper integer limits for group G_i when distributing N entities across k groups with individual capacity constraints [L_j, U_j].
Multi-Attribute Bijective Invariant

∑i=1nMi,j=1,∑j=1nMi,j=1,(Ai↦Bj∧Bj↦Ck)  ⟹  Ai↦Ck\sum_{i=1}^n M_{i, j} = 1, \quad \sum_{j=1}^n M_{i, j} = 1, \quad (A_i \mapsto B_j \land B_j \mapsto C_k) \implies A_i \mapsto C_k

Enforces one-to-one matching across categorical domains in cross-tabulation grids. Confirmation of any cell immediately eliminates its row and column; linkages propagate transitively.
Strictly Distinct Partition Minimal Envelope

N≥∑j=0k−1(L+j)=k⋅L+k(k−1)2N \ge \sum_{j=0}^{k-1} (L + j) = k \cdot L + \frac{k(k - 1)}{2}

Determines the absolute minimum total elements required to construct k strictly distinct integer groups with minimum baseline group size L.

Previous year questions

Recent CAT questions on Grouping & Distribution

  1. CAT 2025 Slot 2 DILR Q6
    What was the total number of pings made by B1, B2, and B3?
  2. CAT 2025 Slot 2 DILR Q7
    Which of the following statements about the relative sizes of the balls is NOT NECESSARILY true?
  3. CAT 2025 Slot 2 DILR Q8
    Which of the following statements about the relative sizes of the hoops is true?
  4. CAT 2025 Slot 2 DILR Q9
    What BEST can be said about the total number of pings from all the tests undertaken?
  5. CAT 2025 Slot 3 DILR Q10
    What was the duration of calls (in minutes) from Bijay to Anu?
  6. CAT 2025 Slot 3 DILR Q11
    What was the total duration of calls (in minutes) made by Anu to friends having mobile numbers from Operator Yocel?
  7. CAT 2025 Slot 3 DILR Q12
    What was the total duration of calls (in minutes) made by Faruq to friends having mobile numbers from Operator Yocel?
  8. CAT 2025 Slot 3 DILR Q13
    What was the duration of calls (in minutes) from Deepak to Chetan?