📚 Study Notes – Seating Arrangement (Reasoning Ability)
(For Manipur Patwari / Lekhpal competitive exam – IIT‑JEE style)
Objective – Master the art of solving seating‑arrangement problems quickly and accurately.
Format – Multiple‑choice, integer‑type, or “arrange the people” questions.
1. Core Concepts
| Concept | What it Means | Typical Usage |
|---|---|---|
| Permutation | Arranging n distinct items in order: (\displaystyle P(n,r)=\frac{n!}{(n-r)!}) |
Counting possible seatings when no restrictions |
| Constraint | A rule that limits positions (e.g., “A must be left of B”) | Forms the backbone of the problem |
| Adjacency | Two seats next to each other | “A sits next to B” |
| Separation | Seats between two persons | “Exactly one seat between A and B” |
| Relative Position | “Left of / Right of” (in a row) or “clockwise / anticlockwise” (in a circle) | Determines order |
| Fixed Seat | A specific seat number is assigned (first, last, middle) | Anchors the arrangement |
| Parity | Odd / even seat numbers | “All odd seats are occupied by females” |
| Opposite | In a circular table, the seat directly across | “A sits opposite B” |
Tip: Convert every verbal constraint into a mathematical inequality or binary relation that can be checked programmatically or by hand.
2. Problem‑Solving Strategy
-
Read the problem carefully
- Write down all constraints in a list.
- Highlight verbs: next to, between, left of, right of, opposite, at least two seats apart, etc.
-
Choose a representation
- Linear row: seats numbered 1–n.
- Circular table: seat numbers modulo n (use 1–n or 0–n‑1).
- Diagram: draw a row or circle and label seats.
-
Anchor the arrangement
- If a person is fixed to a seat (e.g., "A sits in seat 1") place them immediately.
- If someone must be between two others, identify the middle seat(s).
-
Use a slots approach
- Identify the slots that remain free after satisfying mandatory constraints.
- Count how many ways the remaining people can fill those slots.
-
Apply elimination & backtracking
- Try a placement for a key person; if a contradiction arises, backtrack.
- Keep track of possibility trees if multiple branches exist.
-
Check for hidden constraints
- Sometimes a constraint may be implicit (e.g., “no two males adjacent” implies a pattern).
- Verify all constraints after a full placement.
-
Count the arrangements
- If the question asks how many arrangements are possible, use factorial or permutations on the free slots.
- If the question asks who sits where, simply state the positions.
3. Common Constraint Types & How to Encode Them
| Constraint | Encoding (Row of 7 seats) | Example |
|---|---|---|
| A is immediately left of B | pos(A)+1 = pos(B) |
“A sits just left of B” |
| A is anywhere to the left of B | pos(A) < pos(B) |
“A is left of B” |
| Exactly one seat between A and B | ` | pos(A) - pos(B) |
| At least two seats apart | ` | pos(A) - pos(B) |
| A sits in an odd seat | pos(A) mod 2 = 1 |
“A in an odd numbered seat” |
| A sits opposite B (circle of 6) | pos(A) = pos(B) + 3 (mod 6) |
“A opposite B” |
| A sits between B and C (B to the left) | pos(B) < pos(A) < pos(C) |
“B sits left of A |