Tripura PSC /Reasoning Ability

Seating arrangement

Non-Verbal & Puzzles · free study notes

Tripura PSC – Reasoning Ability

Topic: Seating Arrangement

Objective: Master the most common techniques used in competitive exams (IIT‑JEE, Tripura PSC, etc.) to solve seating‑arrangement problems in minimum time and maximum accuracy.

Why it matters:

  • Nearly 25 % of reasoning questions are seating‑arrangement based.
  • They test combinatorics, case‑work and logical deduction.
  • Good understanding reduces time‑pressure during the exam.

1. Quick‑Reference Cheat‑Sheet

Situation Formula / Approach Notes
Linear arrangement (n seats, n people) (n!) All distinct positions.
Circular arrangement (n seats) ((n-1)!) Fix one person to break symmetry.
Two people adjacent (A next to B) (2 \times (n-1)!) Treat (AB) as a block → ( (n-1)! ) arrangements of (n-1) entities × 2! for order inside block.
Two people opposite each other (circular) ((n-3)!) Fix A → B has 1 fixed opposite seat → arrange remaining (n-3) people.
A sits left of B (in a row) (\frac{n!}{2}) Half of all permutations satisfy left/right condition.
A must be at seat 1 ((n-1)!) Seat 1 fixed → arrange remaining.
X cannot sit next to Y Inclusion‑Exclusion: (n! - 2(n-1)!) Count total minus arrangements where X–Y are adjacent.
Multiple adjacency constraints Case‑work / Inclusion‑Exclusion Treat each adjacent pair as a block; adjust for overlaps.
Alternate sexes in a row (\frac{n!}{(n/2)! (n/2)!}) (if (n) even) Seat all males first, then place females in gaps.
Seating in two rows of equal length (\frac{n!}{2!}) (if rows identical) Consider row labels; if rows unlabeled, divide by 2.

2. Classification of Seating‑Arrangement Problems

Class Typical Constraints Key Idea
Linear (Row) Arrangements Fixed seat numbers, left/right, adjacency, gaps, alternation Use permutations & block method.
Circular Arrangements Opposite seats, adjacency, “around the table” Fix one person, treat as linear.
Multi‑row Arrangements Two rows, alternating, “row 1 must contain X” Treat rows as labeled or unlabeled; use permutations within rows.
Graph‑Based Constraints “A must not sit next to B”; “C must be seated between D & E” Inclusion‑Exclusion, case‑work, or graph colouring.
Fixed Positions (e.g., seat number 4) Specific seat assignments Fix position, permute rest.
Symmetry / Rotational Invariance “All arrangements that look the same after rotation are equivalent” Circular factorial formula.

3. Derivation Techniques

3.1 Treating Adjacent Pairs as a Block

Scenario: A & B must sit together in a row of 5 people.

  1. Form a block ([AB]).
  2. Now we have (4) entities: ([AB], C, D, E).
  3. Arrange these (4) entities: (4! = 24).
  4. Inside the block, A & B can swap → (2!) ways.
  5. Total (= 4! \times 2! = 48).

3.2 Circular Arrangements

Scenario: 8 people around a circular table.

  • Fix one person (say, P1) at any seat.
  • Remaining 7 can be arranged arbitrarily: (7! = 5040).
  • This

Your note

Page 1

Doubt hai is topic me?

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