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
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.
- The only entry/exit point is at C.
- 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.
- 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?
Show answer and solution
Answer: (D)
3800
Solution
Concept: Eulerian Circuit on Subgraphs / Perimeter Walk Optimization
Master State Table
| Segment Category | Pathway Segments | Length (m) | Structural Description / Topological Role |
|---|---|---|---|
| Horizontal (East-West) | Left corridor width () | ||
| Central corridor width (, Lake 2 top/bottom) | |||
| Right corridor width (, Lakes 1 & 3 top/bottom) | |||
| Vertical (North-South) | Top tier height (, Lake 1 east/west) | ||
| Middle tier height (, Lake 2 east/west) | |||
| Bottom tier height (, Lake 3 east/west) | |||
| Diagonal Hypotenuse | Shortcut across / () | ||
| Shortcut across () |
Question Deduction
• Objective & Constraints:
-
The person enters at gate , walks along paths strictly adjacent to at least one of the three lakes, does not repeat any path segment, and exits back at .
-
Repeating intersection vertices is permitted. The goal is to maximize total distance traversed.
• Boundary Subgraph Formulation:
-
Lake 1 (Top-Right ): .
-
Lake 2 (Central ): .
-
Lake 3 (Bottom-Right ): .
-
Total combined perimeter across all three lakes: .
• 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 each border exactly one lake: degree .
-
Junction vertex connects Lake 1 and Lake 2: degree .
-
Junction vertex connects Lake 2 and Lake 3: degree .
-
-
Because all vertex degrees are even and the subgraph is connected, an Eulerian circuit exists that traverses of all lake-border segments without repeating any segment.
• Explicit Valid Walk from Gate :
-
Route: .
-
Total Distance Walked: .
-
This matches Option 4 ().
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 and have degree 4 and all others have degree 2, the walk can traverse every single border edge: .
Other questions in this set
- Q6. One resident whose house is located at L, needs to visit the post office as well as the bank. What is the minimum…
- Q8. One resident takes a walk within the gated area starting from A and returning to A without going through any point…
- 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
- CAT 2025 Slot 2 DILR Q6
- CAT 2025 Slot 2 DILR Q7
- CAT 2025 Slot 2 DILR Q8
- CAT 2025 Slot 2 DILR Q9
- CAT 2025 Slot 3 DILR Q10
Practise this question with timing, notes and your mistake notebook.
Practise in PrepSoc