📚 Study Notes – Seating Arrangement (Reasoning Ability)
Target Exam: Puducherry PSC (Competitive Exams such as IIT‑JEE, JEE‑Mains, etc.)
Format: Multiple‑choice / Short answer
1. Quick Overview
| Concept | Typical Question | Key Idea |
|---|---|---|
| Linear Arrangement | 10 people in a queue | Count permutations with constraints |
| Circular Arrangement | 8 people around a round table | Use (n-1)! permutations |
| Adjacency / Separation | “A must sit beside B” | Treat as block or enforce gaps |
| Relative Positions | “C is two seats to the left of D” | Fix positions, reduce degrees of freedom |
| Fixed Seats | “E must sit in seat 3” | Reduce n! by fixing 1 person |
| Multiple Constraints | Combination of any of the above | Systematic elimination or combinatorial counting |
Tip: Always start with the most restrictive condition (fixed seat, adjacency, or required gap).
2. Fundamental Formulae
| Formula | Meaning | Example |
|---|---|---|
n! |
Number of permutations of n distinct people |
5 people → 5! = 120 |
C(n,r) = n!/(r!(n-r)!) |
Number of ways to choose r people from n |
Choose 2 out of 5 → C(5,2)=10 |
P(n,r) = n!/(n-r)! |
Number of ways to arrange r people from n |
Arrange 3 out of 5 → P(5,3)=60 |
| Circular permutations | (n-1)! |
6 people around a table → 5! = 120 |
| Block method | Treat k adjacent people as a single unit → (n-k+1)! * k! |
3 adjacent → (n-2)! * 3! |
| Derangements (no one in original seat) | !n = n! * Σ(-1)^k / k! |
4 people → 9 |
| Inclusion–Exclusion | ` | A∪B |
3. Common Constraint Types & How to Handle Them
| Constraint | Reduction Method | Example |
|---|---|---|
| Fixed Seat | Fix that person, reduce n! to (n-1)! |
If “M sits in seat 5” → treat seat 5 as occupied |
| Adjacency | Treat adjacent persons as one block | “A sits next to B” → block AB → (n-1)! |
| Separation | Count total arrangements then subtract those where they are adjacent | Use inclusion–exclusion |
| Relative Position | Fix relative distance | “C is two seats to the left of D” → place D, then C two seats left |
| Circular Arrangement | Reduce symmetry by fixing one person at a reference seat | “Circular table, A at top” → (n-1)! |
| Multiple Constraints | Apply constraints sequentially, always reducing the effective n |
Combine block method with fixed seat |
4. Step‑by‑Step Problem‑Solving
4.1 Example 1 – Linear Arrangement
Question: 7 people (A–G) are to sit in a row.
- A is at the leftmost seat.
- B must sit to the right of C.
- D and E must not sit together.
Solution Steps
- Fix A → remaining 6 seats for B–G.
- B right of C
- Count all arrangements of B, C, D, E, F, G first:
6!. - Half of them have B right of C →
6!/2 = 360.
- Count all arrangements of B, C, D, E, F, G first:
- D and E not together
- Count arrangements where they are together: block DE → treat as one →
5! * 2! = 240. - Subtract from 360:
360 − 240 = 120.
- Count arrangements where they are together: block DE → treat as one →
Answer: 120 ways.
4.2 Example 2 – Circular Arrangement
Question: 5 couples (10 people) are to sit around a round table.
- No couple should sit together.
Solution Outline
- Fix one person (say, one partner of couple 1) →
9!arrangements. - Place the other partners such that none of them sit next to their own partner.
- Use inclusion–exclusion or derangements on a circle.
- Result for 5 couples:
9! × (1/2)^5(approx) → compute precisely if needed.
(For exam, the answer is typically given as a number derived via detailed inclusion–exclusion.)
5. Tricky Points & Common Pitfalls
| Pitfall | Why it Happens | How to Avoid |
|---|---|---|
| **Misreading “left of” vs “ |