Puzzles: Arrangements, Rankings and Scheduling
CSIR NET Part A puzzles: linear and circular seating, floors, rankings, grid scheduling, weighing, jugs and tournaments, with a step-by-step method.
- 19 min
On this page · 16 sections
- Prerequisites
- The Hook: The Instrument Booking Sheet
- The General Method
- Linear Arrangements
- Circular Arrangements
- Floors, Boxes and Vertical Stacks
- Rankings and Order
- Grid (Matrix) Puzzles: Several Attributes at Once
- Classic Puzzle Types
- Memory Tricks
- Don’t Confuse
- Common Mistakes
- Practice
- Quick Revision Table
- Key Takeaways
- What’s Next
Prerequisites
- Statements, Syllogisms and Arguments: the case-by-case method and the habit of translating “only if” and “not” correctly. A puzzle clue is a logical statement.
- Counting, Probability and Number Properties for arrangements and selections, which appear here as “how many ways” and “how many matches”.
- The previous topic, Series Formation, is not needed, but its “test the rule on every term” discipline is the same as “test the arrangement against every clue”.
The Hook: The Instrument Booking Sheet
The General Method
Every arrangement puzzle, whatever its dressing, is solved the same way:
graph TD
A["1. Read every clue once;
list the people and the slots"] --> B["2. Draw the skeleton:
a row, a circle, a floor stack or a grid"]
B --> C["3. Place FIXED clues first
('C is on Wednesday', 'R is at an end')"]
C --> D["4. Use BLOCKS next
('Q immediately right of P' = one unit PQ)"]
D --> E["5. Branch on the fewest cases;
draw each case separately"]
E --> F["6. Apply NEGATIVE clues to kill cases
('T not next to R')"]
F --> G["7. Check the survivor against EVERY clue"]Clues come in four kinds. Sorting them saves most of the time:
| Kind | Example | When to use |
|---|---|---|
| Fixed | “R sits at one of the ends”, “Genetics is on Friday” | first |
| Block (adjacency) | “Q sits immediately to the right of P” | second; treat the pair as one unit |
| Relative | “U sits somewhere to the right of S”, “exactly two people between S and U” | to generate cases |
| Negative | “T is not adjacent to R”, “B is not on Monday” | to eliminate cases |
Linear Arrangements
People sit in a row. The conventions:
- Facing north (or “facing you”, read carefully): their right is your right as you look at the page. Seat numbers increase to the right.
- Facing south: their right is your left. If a row has people facing both ways, mark an arrow on each person.
- “Immediately right of” means the adjacent seat. “To the right of” means anywhere to the right.
- “Exactly two people between S and U” means \( \lvert \text{seat}_S - \text{seat}_U \rvert = 3 \).
Circular Arrangements
People sit around a round table. The convention that trips people up:
| Facing | Their left is | Their right is |
|---|---|---|
| Towards the centre | clockwise | anticlockwise |
| Away from the centre | anticlockwise | clockwise |
Picture yourself at the bottom of the table looking up at the centre: your left hand points along the clockwise direction. Draw the circle, put the first fixed person at the bottom, and mark “L” and “R” with arrows before placing anyone else.
Other facts:
- In a circle of \( n \) seats, the person opposite seat \( k \) is seat \( k + n/2 \) (only if \( n \) is even).
- There is no “end”, so the first person you place is free: put them anywhere. Every answer is relative.
- The number of distinct seatings of \( n \) people around a round table is \( (n-1)! \), because rotations are the same seating. If clockwise and anticlockwise orders also count as the same (beads on a necklace), it is \( \frac{(n-1)!}{2} \).
Floors, Boxes and Vertical Stacks
A building with floors 1 (bottom) to \( n \) (top), or boxes stacked one on another, is a linear arrangement turned on its side. “Immediately above” means the next floor up. “Above” means any higher floor. Draw the stack with the ground floor at the bottom of the page, exactly as the building stands, and read “even-numbered floor” and “odd-numbered floor” literally.
Rankings and Order
Position in a row or ranking
If a person is \( p \)-th from the top (or left) and \( q \)-th from the bottom (or right), then
$$\boxed{\text{Total} = p + q - 1}$$The \( -1 \) is because the person is counted from both ends.
| Question | Formula |
|---|---|
| Total in the row | \( p + q - 1 \) |
| Position from the other end | \( \text{Total} - p + 1 \) |
| People between A (position \( a \)) and B (position \( b \)), same end | \( \lvert a - b \rvert - 1 \) |
Comparison chains
“P is taller than Q but shorter than R; S is shorter than Q; T is taller than R.” Write a single chain with the greatest on the left, inserting each person as you go:
T > R > P > Q > S
Now “who is the shortest” (S), “who is third tallest” (P) and “how many are taller than Q” (three) are lookups. If a clue does not fix someone’s place relative to all others, write them on a side branch and keep the question in mind: some questions are about exactly what cannot be determined.
Grid (Matrix) Puzzles: Several Attributes at Once
When each person has two or more attributes (a day and a subject, a floor and a colour), draw a table with one row per slot and one column per attribute. Fill it as clues fix entries; cross out options as negative clues remove them.
Classic Puzzle Types
These are small, self-contained puzzles with a known method. Each is worth recognising on sight.
Balance (weighing) puzzles
A two-pan balance has three outcomes per weighing: left heavier, right heavier, balance. So \( k \) weighings can distinguish at most \( 3^k \) cases.
$$\boxed{\text{One heavier coin among } N: \text{ minimum weighings} = \lceil \log_3 N \rceil}$$| Coins (one known to be heavier) | Minimum weighings |
|---|---|
| 2–3 | 1 |
| 4–9 | 2 |
| 10–27 | 3 |
| 28–81 | 4 |
The method: split into three groups as equal as possible, weigh two of them. If they balance, the heavy coin is in the third group.
When the odd coin may be heavier or lighter, there are \( 2N \) cases, so the bound is tighter. The classic result is that 12 coins can still be solved in 3 weighings, but the procedure is intricate and rarely needed in Part A.
Measuring with jugs
With jugs of capacities \( a \) and \( b \) litres (no markings) and an unlimited tap, you can measure exactly those whole-litre amounts up to \( \max(a, b) \) that are multiples of \( \gcd(a, b) \).
River crossings
A boat carries a limited load, and some pairs cannot be left alone together. The classic farmer–wolf–goat–cabbage puzzle needs 7 crossings: take the goat over first, and bring it back once. The general lesson: in crossing puzzles, the move that unlocks the solution is usually a return trip carrying something back.
Tournaments and handshakes
| Situation | Count |
|---|---|
| Each pair meets once (round robin, handshakes) | \( \binom{n}{2} = \frac{n(n-1)}{2} \) |
| Each pair meets twice (home and away) | \( n(n-1) \) |
| Knockout, one winner | \( n - 1 \) matches (every match eliminates one team) |
| Diagonals of an \( n \)-sided polygon | \( \frac{n(n-3)}{2} \) |
The knockout count needs no bracket: every team except the champion loses exactly once.
Memory Tricks
Don’t Confuse
| This | vs | That |
|---|---|---|
| “Immediately to the right” (adjacent) | “To the right” (anywhere on that side) | |
| Facing north: right is your right | Facing south: right is your left | |
| Facing the centre: left = clockwise | Facing outward: left = anticlockwise | |
| Round table seatings \( (n-1)! \) | Seats in a row \( n! \) | |
| “Two people between” (gap of 3 seats) | “Second to the right” (gap of 2 seats) | |
| Round robin \( \frac{n(n-1)}{2} \) | Knockout \( n - 1 \) |
Common Mistakes
Practice
All questions below are original practice questions written for this page. They are not from any CSIR NET paper.
Level 1: Foundation
- A student is 12th from the top and 18th from the bottom of a class ranking. How many students are ranked?
- In how many distinct ways can 6 people sit around a round table?
- How many matches are played in a knockout tournament of 32 teams?
Answers
- 29. \( 12 + 18 - 1 \).
- 120. \( (6-1)! = 5! \).
- 31. Every team except the champion loses exactly once.
Level 2: Part A Style
Practice Q1. One of 8 identical-looking vials is slightly heavier than the rest. Using a two-pan balance, the minimum number of weighings that guarantees finding it is:
(a) 1 (b) 2 (c) 3 (d) 4
Answer: (b) 2
Each weighing has 3 outcomes, so 2 weighings separate up to \( 3^2 = 9 \) cases, and 8 ≤ 9. Method: weigh 3 against 3. If one side is heavier, weigh 1 against 1 from that side (balance means the third). If they balance, the heavy vial is among the remaining 2: weigh them against each other.
One weighing is not enough because it separates only 3 cases. Option (c) is what you get by halving each time (powers of 2).
Practice Q2. Five people P, Q, R, S and T are of different heights. P is taller than Q but shorter than R. S is shorter than Q. T is taller than R. Who is the third tallest?
(a) R (b) P (c) Q (d) Cannot be determined
Answer: (b) P
Chain: T > R > P > Q > S. Every person is placed, so the order is fully determined, and P is third.
Practice Q3. In a row of 30 students all facing the front, Meena is 10th from the left and Ravi is 15th from the right. How many students sit between them?
(a) 4 (b) 5 (c) 6 (d) 7
Answer: (b) 5
Ravi from the left: \( 30 - 15 + 1 = 16 \). Between positions 10 and 16: \( 16 - 10 - 1 = 5 \).
Practice Q4. Using only an unmarked 9 L can and an unmarked 6 L can and a tap, which volume cannot be measured exactly in one of the cans?
(a) 3 L (b) 6 L (c) 4 L (d) 9 L
Answer: (c) 4 L
\( \gcd(9, 6) = 3 \), so only multiples of 3 (3, 6, 9 L) can be measured. To get 3 L: fill the 9 L can and pour into the 6 L can; 3 L remains. 4 L is not a multiple of 3.
Level 3: Multi-Step (Part C depth)
Practice Q5. Five labs P, Q, R, S and T occupy floors 1 (ground) to 5 (top) of a building, one lab per floor. (i) Q is on an even-numbered floor. (ii) R is on the floor immediately above Q. (iii) S is on the ground floor or the top floor. (iv) There are at least two floors’ difference between T and S. (v) P is on a floor below T. (vi) P is not on the ground floor. (vii) T is not on the top floor. Which lab is on floor 3?
(a) P (b) Q (c) R (d) T
Answer: (d) T
From (vi) and (v), P ≥ 2 and T > P, so T ≥ 3; with (vii), T is 3 or 4.
- Q = 2, R = 3. Then T = 4. P must be below T and not on floor 1 or 2 or 3 (all taken or forbidden): impossible.
- Q = 4, R = 5. S must be on floor 1 (5 is taken). T is 3 (4 is taken). P is below T and not on floor 1, so P = 2. Check (iv): T − S = 3 − 1 = 2. Holds.
Order from the ground floor: S, P, T, Q, R. T is on floor 3.
Practice Q6. Six friends A, B, C, D, E and F sit around a round table facing the centre. (i) A sits second to the left of B. (ii) C sits immediately to the right of A. (iii) E sits opposite A. (iv) F is an immediate neighbour of A. Who sits opposite F, and who sits immediately to the right of E?
(a) B; D (b) D; B (c) C; D (d) B; C
Answer: (a) B; D
Number the seats 0 to 5 clockwise and put A at seat 0. Facing the centre, a person’s left neighbour is the next seat clockwise (+1) and the right neighbour is the previous seat (−1).
- (i) A is second to the left of B: A = B + 2, so B = 4.
- (ii) C is immediately right of A: C = 0 − 1 = 5.
- (iii) E opposite A: E = 3.
- (iv) A’s neighbours are seats 1 and 5. Seat 5 is C, so F = 1, and D takes the last seat, 2.
Clockwise from A: A (0), F (1), D (2), E (3), B (4), C (5).
Opposite F (seat 1) is seat 4: B. Immediately to the right of E (seat 3) is seat 2: D. Option (b) gives the two answers in the wrong order; (c) and (d) do not match the only arrangement the clues allow.
Practice Q7. Use the booking-sheet puzzle from the worked example above (A ecology Monday, E mathematics Tuesday, C chemistry Wednesday, B physics Thursday, D genetics Friday). Suppose clue (viii) “C does not present ecology” is removed. Which of the following can still be determined with certainty?
- Who speaks on Tuesday
- The subject on Monday
- The subject presented by E
- The day on which chemistry is presented
(a) 1 and 3 only (b) 1, 2 and 3 only (c) 2 and 4 only (d) 1, 3 and 4 only
Answer: (a) 1 and 3 only
Without (viii), the day–person table is unchanged (it never used (viii)), and Friday genetics, Thursday physics and Tuesday mathematics are still forced. Only ecology and chemistry are free to swap between Monday (A) and Wednesday (C).
- 1: Tuesday is E. Determined.
- 2: Monday is ecology or chemistry. Not determined.
- 3: E presents mathematics. Determined.
- 4: Chemistry is Monday or Wednesday. Not determined.
This is the “what survives every case” question: list both surviving arrangements and keep only what they share.
Quick Revision Table
| Idea | Rule |
|---|---|
| Clue order | Fixed → Block → Relative → Negative; check all at the end |
| Facing north | their right = your right |
| Facing the centre | left = clockwise, right = anticlockwise |
| Opposite seat (n even) | \( k + n/2 \) |
| Round-table seatings | \( (n-1)! \); necklace \( (n-1)!/2 \) |
| Rank | total = from top + from bottom − 1 |
| Between two positions | \( \lvert a - b \rvert - 1 \) |
| Grid puzzles | one row per slot, one column per attribute |
| Undetermined cases | answer only what every case shares |
| Balance | \( 3^k \) cases in \( k \) weighings |
| Jugs | multiples of \( \gcd(a, b) \) up to \( \max(a, b) \) |
| Round robin / knockout | \( \frac{n(n-1)}{2} \) / \( n - 1 \) |
Key Takeaways
What’s Next
- Analytical Reasoning: Directions, Relations, Calendars and Figures: the next topic.
- Statements, Syllogisms and Arguments: truth-teller puzzles use the same case method.
- Counting, Probability and Number Properties: permutations, combinations and the gcd used here.
- Logical Reasoning: Quick Revision.