CAT 2024 Slot 2 DILR Q7

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Grids
  • Hard
  • Multiple choice
  • CAT_2024_SLOT2_DILR_Q07

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 7

One person enters the gated area and decides to walk as much as possible before leaving the area without walking along any path more than once and always walking next to one of the lakes. Note that he may cross a point multiple times. How much distance (in m) will he walk within the gated area?

  1. A

    3200

    Answer A in PrepSoc practice
  2. B

    2800

    Answer B in PrepSoc practice
  3. C

    3000

    Answer C in PrepSoc practice
  4. D

    3800

    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)

3800

Solution

Concept: Eulerian Circuit on Subgraphs / Perimeter Walk Optimization

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 & Constraints:

  • The person enters at gate CC, walks along paths strictly adjacent to at least one of the three lakes, does not repeat any path segment, and exits back at CC.

  • Repeating intersection vertices is permitted. The goal is to maximize total distance traversed.

• Boundary Subgraph Formulation:

  • Lake 1 (Top-Right CDEFCDEF): CD+DE+EF+FC=300+400+300+400=1400 mCD + DE + EF + FC = 300 + 400 + 300 + 400 = 1400\text{ m}.

  • Lake 2 (Central GFKJGFKJ): GF+FK+KJ+JG=300+200+300+200=1000 mGF + FK + KJ + JG = 300 + 200 + 300 + 200 = 1000\text{ m}.

  • Lake 3 (Bottom-Right KLMNKLMN): KL+LM+MN+NK=300+400+300+400=1400 mKL + LM + MN + NK = 300 + 400 + 300 + 400 = 1400\text{ m}.

  • Total combined perimeter across all three lakes: 1400+1000+1400=3800 m1400 + 1000 + 1400 = 3800\text{ m}.

• Eulerian Graph Parity Proof:

  • An edge-simple closed walk traversing every boundary segment exists if and only if all vertex degrees in the lake-boundary subgraph are even:

    • Peripheral vertices C,D,E,G,J,L,M,NC, D, E, G, J, L, M, N each border exactly one lake: degree =2= 2.

    • Junction vertex FF connects Lake 1 and Lake 2: degree =2+2=4= 2 + 2 = 4.

    • Junction vertex KK connects Lake 2 and Lake 3: degree =2+2=4= 2 + 2 = 4.

  • Because all vertex degrees are even and the subgraph is connected, an Eulerian circuit exists that traverses 100%100\% of all lake-border segments without repeating any segment.

• Explicit Valid Walk from Gate CC:

  • Route: C→D→E→F→G→J→K→L→M→N→K→F→CC \to D \to E \to F \to G \to J \to K \to L \to M \to N \to K \to F \to C.

  • Total Distance Walked: 300+400+300+300+200+300+300+400+300+400+200+400=3800 m300 + 400 + 300 + 300 + 200 + 300 + 300 + 400 + 300 + 400 + 200 + 400 = 3800\text{ m}.

  • This matches Option 4 (38003800).

Topper Take

• Eulerian Parity Shortcut: When asked to traverse a network without edge repeats while touching every lake edge, check vertex degrees. Since junction nodes FF and KK have degree 4 and all others have degree 2, the walk can traverse every single border edge: Perimeter(Lake 1+Lake 2+Lake 3)=1400+1000+1400=3800 m\text{Perimeter}(\text{Lake 1} + \text{Lake 2} + \text{Lake 3}) = 1400 + 1000 + 1400 = 3800\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. Q8. One resident takes a walk within the gated area starting from A and returning to A without going through any point…
  3. Q9. Visitors coming for morning walks are allowed to enter as long as they do not pass by any of the residences and do not…

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