CAT 2019 Slot 1 DILR Q19

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Routes & Networks
  • Medium
  • Multiple choice
  • CAT_2019_SLOT1_DILR_Q19

Data set · questions 17–20

The figure below shows the street map for a certain region with the street intersections marked from a through I. A person standing at an intersection can see along straight lines to other intersections that are in her line of sight and all other people standing at these intersections. For example, a person standing at intersection g can see all people standing at intersections b, c, e, f, h, and k. In particular, the person standing at intersection g can see the person standing at intersection e irrespective of whether there is a person standing at intersection f.

Diagram

Six people U, V, W, X, Y, and Z, are standing at different intersections. No two people are standing at the same intersection.

The following additional facts are known.

  1. X, U, and Z are standing at the three corners of a triangle formed by three street segments.
  2. X can see only U and Z.
  3. Y can see only U and W.
  4. U sees V standing in the next intersection behind Z.
  5. W cannot see V or Z.
  6. No one among the six is standing at intersection d.

Question 19

What is the minimum number of street segments that X must cross to reach Y?

  1. A

    1

    Answer A in PrepSoc practice
  2. B

    4

    Answer B in PrepSoc practice
  3. C

    3

    Answer C in PrepSoc practice
  4. D

    2

    Answer D in PrepSoc practice

Answer this questionOr tap an option. Opens in practice mode, free, no sign-in.

Show answer and solution

Answer: (D)

2

Solution

Concept: Network Geodesic Distance, Graph Edge Traversal & Diagonal Path Optimization

Master State Table

IntersectionPositionResidentVisible IntersectionsVisible PeopleInvariant Basis
aRow 1, Col 1Noneb, c, d, e, iX, VEmpty; seen by X at b (Clue 2)
bRow 2, Col 1Xa, c, d, f, g, jZ, UVertex of Δ(b,f,g)\Delta(b, f, g); sees only U, Z (Clue 2)
cRow 3, Col 1Nonea, b, d, g, kX, U, YEmpty; seen by X at b (Clue 2)
dRow 4, Col 1Nonea, b, c, h, lX, WEmpty per Clue 6
eRow 1, Col 2Va, f, g, h, iZ, UFixed behind Z(f) along Col 2 (Clue 4)
fRow 2, Col 2Zb, e, g, h, jX, V, UVertex of Δ(b,f,g)\Delta(b, f, g); collinear U-Z-V
gRow 3, Col 2Ub, c, e, f, h, kX, V, Z, YVertex of Δ(b,f,g)\Delta(b, f, g); sees V behind Z
hRow 4, Col 2Noned, e, f, g, lV, Z, U, WEmpty; visible to V, Z (Clue 5)
iRow 1, Col 3Nonea, e, j, k, lV, Y, WEmpty; avoids extra visibility
jRow 2, Col 3Noneb, f, i, k, lX, Z, Y, WEmpty; seen by X at b (Clue 2)
kRow 3, Col 3Yc, g, i, j, lU, WFixed at (3,3); sees only U, W (Clue 3)
lRow 4, Col 3Wd, h, i, j, kYFixed at (4,3); blind to V, Z (Clue 5)

Question Deduction

• Endpoint Coordinates:

• From the Master State Table, invariant positions are:

• Person $X$ is stationed at intersection $b$ (Row 2, Column 1).

• Person $Y$ is stationed at intersection $k$ (Row 3, Column 3).

• Path Exploration & Geodesic Analysis:

• Standard orthogonal paths (without diagonal):

• Moving along row and column edges from $b(2,1)$ to $k(3,3)$ requires $\vert 3-2 \vert + \vert 3-1 \vert = 3$ segments (e.g., $b \to c \to g \to k$).

• Utilizing the diagonal shortcut (b−gb-g):

• Diagonal traversal: Move from $b$ to $g$ along diagonal segment $b-g$ (1 segment).

• Horizontal traversal: Move from $g$ to $k$ along horizontal segment $g-k$ (1 segment).

• Total segments traversed: $1 + 1 = 2$.

• Minimality Proof:

• A path of 1 segment requires a direct edge between bb and kk, which does not exist in the graph.

• With a valid 2-segment path established (b→g→kb \to g \to k), the minimum number of street segments is strictly 2.

• Option Matching:

• Matches Option 4 ("2"). Distractors fail (no direct edge for "1"; "3" and "4" are suboptimal).

Topper Take

• Spot the diagonal shortcut: b−gb-g reduces Manhattan distance between bb and kk from 3 to 2 segments (b→g→kb \to g \to k).

• Exam triage: check diagonal access from bb to gg and adjacent horizontal access from gg to kk to mark Option 4 in 10 seconds.

Other questions in this set

  1. Q17. Who is standing at intersection a?
  2. Q18. Who can V see?
  3. Q20. Should a new person stand at intersection d, who among the six would she see?

Routes & Networks questions from other CAT papers

  1. CAT 2023 Slot 3 DILR Q11
    Which one among the following stations is visited the largest number of times?
  2. CAT 2023 Slot 3 DILR Q12
    How many times do the teams pass through Station B in a day?
  3. CAT 2023 Slot 3 DILR Q13
    Which team patrols the street connecting Stations D and E at 10:15 hrs?
  4. CAT 2023 Slot 3 DILR Q14
    How many times does Team 4 pass through Station E in a day?
  5. CAT 2023 Slot 3 DILR Q15
    How many teams pass through Station C in a day?

Practise this question with timing, notes and your mistake notebook.

Practise in PrepSoc