Introduction
Direction & Distance Data Sufficiency problems ask whether the given statements provide enough information to determine distances, shortest paths, or relative positions when people/objects move in specified directions. These questions focus on sufficiency - you must decide if each statement alone yields a unique answer or if the statements must be combined.
This pattern is important because travel and bearing problems are common in aptitude tests and often require converting verbal directions into vector or coordinate relations before testing uniqueness.
Pattern: Direction and Distance Based Data Sufficiency
Pattern
The key idea is to convert directional statements into vector (coordinate) relations and check whether those relations uniquely determine the required distance or relative position.
Typical conversions:
North → +y, South → -y, East → +x, West → -x.
Use Pythagoras for straight-line distances and combine vector displacements when needed. Determine whether the system of equations from the statements yields a unique numeric result.
Step-by-Step Example
Question
What is the shortest distance between A and B?
(I) A is 3 km north of C.
(II) B is 4 km east of C.
A. Only (I) is sufficient
B. Only (II) is sufficient
C. Each statement alone is sufficient
D. Both statements together are necessary
Solution
-
Step 1: Analyze Statement (I)
A is 3 km north of C ⇒ vector A = (0, +3) relative to C. This alone does not give B’s location, so cannot find A-B distance → (I) insufficient. -
Step 2: Analyze Statement (II)
B is 4 km east of C ⇒ vector B = (+4, 0) relative to C. This alone does not give A’s location, so cannot find A-B distance → (II) insufficient. -
Step 3: Combine
With both statements, A = (0,3) and B = (4,0) relative to C. Shortest distance AB = √((4 - 0)² + (0 - 3)²) = √(16 + 9) = √25 = 5 km → both together sufficient. -
Final Answer:
Both statements together are necessary → Option D -
Quick Check:
Apply Pythagoras to (4, -3) vector → 5 km ✅
Quick Variations
1. Straight-line (shortest) vs path distance: distinguish whether statements ask for displacement or path taken.
2. Bearing questions: convert bearings (e.g., N30°E) into x/y components using trigonometry.
3. Relative movement: if two objects move, convert into relative velocity vectors to get closing/opening speed and distances.
4. Multiple-way paths: combine segment vectors sequentially (A→B→C) and reduce to net displacement.
Trick to Always Use
- Step 1: Convert every directional phrase into x/y displacement (East = +x, North = +y, etc.).
- Step 2: Represent unknown positions relative to a common origin (choose one point like C as (0,0)).
- Step 3: Use vector subtraction to get AB = (x_B - x_A, y_B - y_A) and apply Pythagoras for shortest distance.
- Step 4: Check uniqueness: if the equations leave free variables or ambiguous signs, the statement(s) are insufficient.
Summary
Summary
- Always convert directional statements into coordinate displacements before combining them.
- Distinguish between path distance (sum of segments) and shortest straight-line distance (use vector resultant).
- Combine statements only when they provide independent components (x and y) needed for a unique answer.
- Quick check: If the final vector has both x and y components determined, use √(x² + y²) for the shortest distance; if one component is missing, data is insufficient.
Example to remember:
If A is 3 km north of C and B is 4 km east of C, then AB = 5 km by Pythagoras.
Hint: Use both perpendicular displacements to find shortest distance via Pythagoras.
Common Mistakes: Trying to find distance using one statement only.