CAT 2024 Slot 2 DILR Q9

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Grids
  • Hard
  • Type in the answer (TITA)
  • CAT_2024_SLOT2_DILR_Q09

Data set · questions 6–9

Diagram

The above is a schematic diagram of walkways (indicated by all the straight lines) and lakes (3 of them, each in the shape of rectangles - shaded in the diagram) of a gated area. Different points on the walkway are indicated by letters (A through P) with distances being OP = 150 m, ON = MN = 300 m, ML = 400 m, EL = 200 m, DE = 400 m.

The following additional information about the facilities in the area is known.

  1. The only entry/exit point is at C.
  2. There are many residences within the gated area; all of them are located on the path AH and ML with four of them being at A, H, M, and L.
  3. The post office is located at P and the bank is located at B.

Question 9

Visitors coming for morning walks are allowed to enter as long as they do not pass by any of the residences and do not cross any point (except C) more than once. What is the maximum distance (in m) that such a visitor can walk within the gated area?

Type-in-the-answer (TITA) question: no options are given; enter the value.

Answer this question Opens in practice mode, free, no sign-in.

Show answer and solution

Answer:

3500

Solution

Concept: Constrained Subgraph Simple Cycles / Node-Deletion Hamiltonian Paths

Master State Table

Segment CategoryPathway SegmentsLength (m)Structural Description / Topological Role
Horizontal (East-West)AB∥HG∥IJ∥POAB \parallel HG \parallel IJ \parallel PO150150Left corridor width (OP=150 mOP = 150\text{ m})
BC∥GF∥JK∥ONBC \parallel GF \parallel JK \parallel ON300300Central corridor width (ON=300 mON = 300\text{ m}, Lake 2 top/bottom)
CD∥FE∥KL∥NMCD \parallel FE \parallel KL \parallel NM300300Right corridor width (MN=300 mMN = 300\text{ m}, Lakes 1 & 3 top/bottom)
Vertical (North-South)AH∥BG∥CF∥DEAH \parallel BG \parallel CF \parallel DE400400Top tier height (DE=400 mDE = 400\text{ m}, Lake 1 east/west)
HI∥GJ∥FK∥ELHI \parallel GJ \parallel FK \parallel EL200200Middle tier height (EL=200 mEL = 200\text{ m}, Lake 2 east/west)
IP∥JO∥KN∥LMIP \parallel JO \parallel KN \parallel LM400400Bottom tier height (ML=400 mML = 400\text{ m}, Lake 3 east/west)
Diagonal HypotenuseIGIG250250Shortcut across ΔIHJ\Delta IHJ / ΔIGJ\Delta IGJ (1502+2002=250 m\sqrt{150^2 + 200^2} = 250\text{ m})
OKOK500500Shortcut across ΔONK\Delta ONK (3002+4002=500 m\sqrt{300^2 + 400^2} = 500\text{ m})

Question Deduction

• Objective & Residence Restrictions:

  • Visitors must enter and exit at gate CC and cannot cross any point (except CC) more than once (a simple cycle).

  • Crucial Constraint: They must not pass by any residences.

  • From the passage, all residences are located on paths AHAH and MLML, with four residences specifically at A,H,M,LA, H, M, L.

  • Therefore, vertices {A,H,M,L}\{A, H, M, L\} and segments AH,MLAH, ML are strictly excluded from the traversable network.

• Available Permissible Subgraph:

  • Total network vertices: 1616.

  • Forbidden residential vertices: 44 (A,H,M,LA, H, M, L).

  • Maximum possible vertices that can be visited in any residential-free cycle: 16−4=1216 - 4 = 12 vertices:

    Vallowed={B,C,D,E,F,G,I,J,K,N,O,P}\mathcal{V}_{\text{allowed}} = \{B, C, D, E, F, G, I, J, K, N, O, P\}

• Constructing the 12-Vertex Maximum Cycle:

  • To maximize distance, the cycle must visit all 1212 permissible vertices while avoiding diagonal shortcuts:

    C→D→E→F→K→N→O→P→I→J→G→B→CC \to D \to E \to F \to K \to N \to O \to P \to I \to J \to G \to B \to C

  • Node Visit Audit: C→D→E→F→K→N→O→P→I→J→G→B→CC \to D \to E \to F \to K \to N \to O \to P \to I \to J \to G \to B \to C.

  • All 1212 permitted vertices are visited exactly once without touching A,H,MA, H, M, or LL.

• Segment-by-Segment Length Aggregation:

\text{Total Distance} &= CD + DE + EF + FK + KN + NO \\ &\quad + OP + PI + IJ + JG + GB + BC \\ &= 300 + 400 + 300 + 200 + 400 + 300 \\ &\quad + 150 + 400 + 150 + 200 + 400 + 300 \\ &= 3500\text{ m} \end{aligned}$$ - Visiting all $12$ available vertices via full perimeter edges guarantees that $3500\text{ m}$ is the absolute maximum. ### Topper Take • **Forbidden Node Pruning**: Deleting the 4 residential vertices $\{A, H, M, L\}$ isolates the remaining 12 nodes. Weaving an outer-loop simple cycle through all 12 valid vertices without hypotenuse shortcuts yields the maximum allowed distance of $3500\text{ m}$.

Other questions in this set

  1. Q6. One resident whose house is located at L, needs to visit the post office as well as the bank. What is the minimum…
  2. Q7. One person enters the gated area and decides to walk as much as possible before leaving the area without walking along…
  3. Q8. One resident takes a walk within the gated area starting from A and returning to A without going through any point…

Grids questions from other CAT papers

  1. CAT 2025 Slot 2 DILR Q6
    What was the total number of pings made by B1, B2, and B3?
  2. CAT 2025 Slot 2 DILR Q7
    Which of the following statements about the relative sizes of the balls is NOT NECESSARILY true?
  3. CAT 2025 Slot 2 DILR Q8
    Which of the following statements about the relative sizes of the hoops is true?
  4. CAT 2025 Slot 2 DILR Q9
    What BEST can be said about the total number of pings from all the tests undertaken?
  5. CAT 2025 Slot 3 DILR Q10
    What was the duration of calls (in minutes) from Bijay to Anu?

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

Practise in PrepSoc