Ranking and Ordering: Logical Reasoning Notes for BITSAT

Ranking & Ordering – Logical Reasoning

Target Audience: BITSAT & other IIT‑JEE level competitive exams
Exam Focus: 12‑question section, 3 marks each (total 36 marks)

1. What is Ranking & Ordering?

In a ranking problem you are given a set of items (people, objects, events, etc.) and a list of partial constraints that relate these items.
Your task: arrange the items in a linear order (first, second, …) that satisfies all the constraints.

Key Feature – The constraints are relative (e.g., “A is older than B” or “C sits to the left of D”).
Goal – Find a unique ordering or all possible orderings that satisfy the constraints.

2. Core Concepts & Terminology

Term	Meaning
Relative Ranking	Comparison between two items (e.g., X > Y).
Transitivity	If X > Y and Y > Z, then X > Z.
Absolute Ranking	Direct statement (e.g., X is 1st).
Gap Constraint	“X is at least 2 spots after Y.”
Adjacency Constraint	“X is immediately before/after Y.”
Position Constraint	“X is in position 3.”
Group Constraint	“X and Y are together” or “X and Y are separated by at least one item.”

3. General Strategy (Step‑by‑Step)

Step	Action	Why It Helps
1. Enumerate all items	Write the list of items in a row.	Gives a visual “grid” to place items.
2. Note absolute positions	Place items whose exact rank is given.	Fixes anchors for relative placement.
3. Write all relative constraints	Convert each sentence into a directed edge (X → Y).	Turns the problem into a directed graph.
4. Apply Transitivity	Use the graph to deduce implicit relations.	Eliminates contradictions early.
5. Create a “partial order” table	Draw a table (rows = items, columns = positions) and shade impossible cells.	Helps keep track of viable positions.
6. Use elimination	Narrow down possibilities for each item.	Reduces search space dramatically.
7. Check consistency	Verify that all constraints hold in the final tableau.	Prevents hidden contradictions.
8. Identify multiple solutions	If more than one ordering satisfies all constraints, look for “must‑be” positions (e.g., “X must be 1st in every solution”).	Some questions ask for “possible” or “impossible” positions.
9. Time‑savvy trick	When stuck, pick the most restrictive constraint (largest gap or adjacency) and try it first.	Often splits the search space most effectively.

4. Common Types of Ranking Problems

Type	Typical Constraints	Example
Linear Ranking	Absolute positions + relative comparisons	“A is 2nd, B is older than C.”
Gap Ranking	“At least k positions after/before.”	“D is at least 3 places after E.”
Adjacency Ranking	“Immediately before/after.”	“F sits right next to G.”
Group Ranking	“Two items together as a block.”	“H and I are always adjacent.”
Circular/Rotational	Items arranged in a circle; only relative comparisons matter.	“J is to the left of K in a circular seating.”
Multiple Constraints	Combination of the above.	“L is 1st, M is 3rd, N is between O and P.”

5. Derivation of Key Rules

Transitivity Rule
[ \text{If } X > Y \text{ and } Y > Z \Rightarrow X \text{ is ahead of } Z ] Proof: Ranking is a total order; if X precedes Y and Y precedes Z, X must precede Z.
Adjacency Implies Gap = 1
[ X \text{ immediately before } Y \Rightarrow X \text{ is exactly 1 spot ahead of } Y ]
Gap Constraint
[ X \text{ is at least } k \text{ places after } Y \Rightarrow \text{Position}(X) \ge \text{Position}(Y)+k ]
Block Constraint
If items A and B are adjacent and must stay together, treat them as a single entity (AB) for ordering purposes.
Note: If the block itself has an internal order fixed, keep that order.
Uniqueness of Ordering
If all items can be placed with no ambiguity, the ordering is unique.
If at least one item can occupy more than one slot without violating constraints, multiple orderings exist.

6. Tricky Points & Common Pitfalls

Pitfall	How to Avoid
Ignoring Transitivity	Always check derived relations before finalizing.
Assuming Adjacent Means “Next to”	Confirm whether the problem explicitly states “immediately” or just “next”.
Over‑counting Gaps	Remember a “gap of 2” means two items between them, not two positions difference.
Treating Groups as Single Items Irrespective of Internal Order	If internal order is unspecified, treat them as a block but allow internal permutations.
Believing All Constraints Are Independent	Some constraints are redundant; simplification reduces work.
Misreading “at least” vs. “exactly”	“At least 3 after” means 3 or more positions apart.
Assuming Circular Constraints Are Linear	For circular