EdiShorts

UPSC Prelims 2025 CSAT Q65 · Reasoning

Year2025
PaperCSAT
QuestionQ65
SubjectReasoning

There are 7 places A, B, C, D, E, F and G in a city connected by various roads AB, AC, CD, DE, BF, EG and FG. A is 6 km south of B. A is 10 km west of C. D is 5 km east of E. C is 6 km north of D. F is 9 km west of B. F is 12 km north of G. A person travels from D to F through these roads. What is the distance covered by the person?

  1. a20 km
  2. b25 km
  3. c31 km
  4. d37 km
Show answer & explanationHide answer
Correct answer(c) 31 km

The total distance along the connected road network from D to F (D-C-A-B-F or D-E-G-F) equals 31 km.

Statement-by-statement analysis

✗ Option (a)
  • 20 km represents an incorrect calculation or straight-line distance attempt.
  • The actual road path distance from D to F is 31 km.
✗ Option (b)
  • 25 km fails to account for all road segments in the path.
  • The path D to F via C, A, B requires 6 + 10 + 6 + 9 = 31 km.
✓ Option (c)
  • Path 1: D to C (6 km) + C to A (10 km) + A to B (6 km) + B to F (9 km) = 31 km.
  • Path 2: D to E (5 km) + E to G (14 km) + G to F (12 km) = 31 km.
  • Hence, the total distance covered traveling along the available roads is 31 km.
✗ Option (d)
  • 37 km overcounts by including unnecessary segments outside the connecting path.
  • The minimal network distance between D and F is exactly 31 km.

Concept to know

  • Direction and Distance problems involve mapping relative positions on a Cartesian coordinate grid.
  • Road Network vs Displacement: Total distance covered refers to the sum of lengths of road segments traveled, not the shortest straight-line displacement.
  • Grid Alignment: Vertically aligned points share x-coordinates, while horizontally aligned points share y-coordinates.
  • Path Tracing: Identify connected edges from the start node to the destination node and sum their respective lengths.
  • Verification via alternate paths confirms consistency when multiple valid routes exist in the problem design.

Related facts for revision

  • Shortest displacement calculations using the Pythagorean theorem.
  • Network graph traversal problems where paths must follow given named edges.
  • Shadow and sun position directional problems.
  • Turns and compass direction tracking such as North-East and South-West movements.
How UPSC tests this

Spatial mapping, graph traversal, and distance summation along specified paths.

Trap: Confusing actual distance along roads with shortest displacement or skipping a road segment in the chain.

More Reasoning PYQs

All Reasoning questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.