CMAT /Data Interpretation & Logical Reasoning

Arrangements

Logical Reasoning · free study notes · Updated

Arrangements – CMAT Study Notes

(Data Interpretation & Logical Reasoning)


1. Simple Explanation

An arrangement problem asks you to count the ways to place objects (people, items, numbers, etc.) in a line, a circle, or any other structure while respecting a set of constraints.

  • Permutation – The order matters.

    • Linear permutation: (n!) ways to arrange (n) distinct objects.
    • Circular permutation: ((n-1)!) ways, because rotations are considered identical.
  • Combination – The order does not matter.

    • (C(n,r)=\dfrac{n!}{r!(n-r)!}) ways to choose (r) objects from (n).

When constraints are added (e.g., “A must sit next to B”, “C cannot be adjacent to D”), the counting changes. The usual strategy is:

  1. Identify the type of arrangement (linear, circular, with/without repetition).
  2. Count the total arrangements without constraints.
  3. Apply constraints using one of the following techniques:
    • Block method (treat restricted objects as a single entity).
    • Inclusion–Exclusion (add back arrangements that violate constraints).
    • Complementary counting (count total minus forbidden arrangements).
    • Case analysis (break into mutually exclusive cases).

2. Key Points & Formulas

Category Formula Notes
Linear permutations (n!) Order matters. No repetition.
Circular permutations ((n-1)!) Rotations considered identical; fix one object to break symmetry.
Permutations with repetition (\dfrac{n!}{n_1!n_2!\dots n_k!}) (n_i) = count of identical items of type (i).
Combinations (C(n,r)=\dfrac{n!}{r!(n-r)!}) Order irrelevant.
Block method Treat a group of objects as one “super‑object”. After forming the block, permute the block + remaining items.
Inclusion‑Exclusion (N = N_{\text{total}} - \sum N_{\text{single violation}} + \sum N_{\text{double violation}} - \dots) Useful for multiple constraints.
Complementary counting (N = N_{\text{total}} - N_{\text{invalid}}) When invalid cases are easier to count.
Adjacent restriction For two specific items: (2(n-1)!) (they can be swapped inside the block). For no adjacency: total – arrangements with adjacency.

3. Worked Example

Problem
Five friends – A, B, C, D, E – are to sit in a row of 5 seats.
Constraints:

  1. A must sit to the left of B (not necessarily immediately).
  2. C must not sit at either end.
  3. D and E must not sit next to each other.

How many seating arrangements satisfy all constraints?


Step‑by‑Step Solution

  1. Total linear arrangements of 5 distinct people:
    [ 5! = 120 ]

  2. Apply constraint 1 – A left of B

    • For any pair (A,B) in a row, exactly half of the arrangements have (A) left of (B).
    • So divide by 2:
      [ 120 \div 2 = 60 ]
  3. Apply constraint 2 – C not at an end

    • Count arrangements where C is at an end, then subtract from 60.
    • If C is at left end: place C → 4 remaining positions for others: (4! = 24).
    • If C is at right end: another 24.
    • Total invalid due to C at an end: (24 + 24 = 48).

    Subtract from 60:
    [ 60 - 48 = 12 ]

  4. Apply constraint 3 – D and E not adjacent

    • Count how many of the 12 arrangements have D and E adjacent, then subtract.
    • Treat DE or ED as a block.
      • Block + remaining 3 people → 4 objects to arrange: (4! = 24).
      • Inside the block, D and E can swap: (2) ways.
      • So arrangements with D & E adjacent: (24 \times 2 = 48).

    However, we must intersect this with the previous constraints (A left of B & C not at ends).
    Counting directly is easier now because we already reduced to 12 arrangements that satisfy the first two constraints. We can enumerate them or use complementary counting.

    Method:

    • List the 12 valid arrangements (quick enumeration).
    • Count those where D and E are adjacent.
    # Arrangement (Left→Right)
    1 A C D B E
    2 A C D E B
    3 A C E B D
    4 A D C B E
    5 A D E B C
    6 A E B C D
    7 A E B D C
    8 A B C D E
    9 A B C E D
    10 B C A D E
    11 B C A E D
    12 B C D A E

    (All satisfy A left of B, C not at ends.)

    Now check adjacency of D & E:

    • #1: D & E are not adjacent (D and B between).
    • #2: D and E are adjacent at positions 3‑4 → invalid.
    • #3: D at

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.