IIM CAT 2026 cheat sheet for Logical Reasoning! 📱 Practice 1 Lakh+ PYQs on ExamBhai.com! - Free Study Material

Chapter Summary: Logical Reasoning for CAT 2026

Mastering Logical Reasoning (LR) for the IIM CAT requires a structured approach to decoding complex arrangements, set relations, and analytical puzzles. Below is a comprehensive overview of fundamental LR concepts, frameworks, and solution strategies.

1. Linear and Circular Arrangements

Arrangement problems test spatial organization based on given conditional constraints. The key is to fix definitive positions before evaluating relative ones.

• Linear Setup: Map positions along a single axis. For \(n\) distinct entities, total unconstrained arrangements equal \(n!\).
• Circular Setup: For \(n\) entities seated around a circular table:
  • Facing center: Left is clockwise, right is counter-clockwise.
  • Total arrangements around a circle = \((n - 1)!\).

2. Venn Diagrams and Set Theory

Set-based reasoning relies on analyzing overlapping groups to resolve missing variables using the Principle of Inclusion-Exclusion.

• Two-Set Formula: \[n(A \cup B) = n(A) + n(B) - n(A \cap B)\]
• Three-Set Formula: \[n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(C \cap A) + n(A \cap B \cap C)\]
• Maximization and Minimization: To minimize the intersection \(n(A \cap B)\), maximize the combined non-overlapping elements subject to total universe constraint \(U\).

3. Selection Matrix and Truth-Teller Games

Complex puzzles often involve cross-referencing attributes (e.g., matching people to occupations and locations) or solving binary logic scenarios.

• Matrix Grids: Use a binary grid (ticks and crosses) to enforce one-to-one mapping rules across multiple parameters.
• Truth-Teller / Liar Logic: Assume a scenario for a given speaker (assume Speaker A is telling the truth), then test for internal contradictions across remaining statements.

4. Games and Tournaments

Knockout and round-robin tournament sets evaluate scoring matrices, ranks, and seeding.

• In a round-robin tournament of \(n\) teams, total matches played = \(\frac{n(n - 1)}{2}\).
• In a single-elimination knockout tournament of \(n\) teams, total matches required to determine a winner = \(n - 1\).