CAT 2023 Slot 3 DILR Q14
- Data Interpretation and Logical Reasoning
- Logical Reasoning › Routes & Networks
- Hard
- Type in the answer (TITA)
- CAT_2023_SLOT3_DILR_Q14
Data set · questions 11–15
A, B, C, D, E and F are the six police stations in an area, which are connected by streets as shown below. Four teams - Team 1, Team 2, Team 3 and Team 4 - patrol these streets continuously between 09:00 hrs and 12:00 hrs each day.
The teams need 30 minutes to cross a street connecting one police station to another. All four teams start from Station A at 09:00 hrs and must return to Station A by 12:00 hrs. They can also pass via Station A at any point on their journeys.
The following facts are known.
- None of the streets has more than one team traveling along it in any direction at any point in time.
- Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
- Teams 1 and 3 are the only ones in station E at 10:30 hrs.
- Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
- Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
- Team 4 never passes through Stations B, D or F.
Question 14
How many times does Team pass through Station E in a day?
Type-in-the-answer (TITA) question: no options are given; enter the value.
Show answer and solution
Answer:
2
Solution
Concept: Network Flow Constraints, Non-Overlapping Trajectories & Path Elimination
Master State Table
| Time | Team 1 | Team 2 | Team 3 | Team 4 |
|---|---|---|---|---|
| 09:00 | Station A | Station A | Station A | Station A |
| 09:30 | Station B | Station F | Station C | Station E |
| 10:00 | Station A | Station E | Station D | Station A |
| 10:30 | Station E | Station F | Station E | Station C |
| 11:00 | Station A | Station E / A | Station D | Station A |
| 11:30 | Station B | Station F | Station C | Station E |
| 12:00 | Station A | Station A | Station A | Station A |
Question Deduction
• Full Trajectory of Team 4:
• Constraints: Team 4 never visits B, D, or F limited strictly to vertices {A, C, E}.
• From A, the only available streets are A–E and A–C.
• 09:00: Starts at Station A.
• 09:30: Traverses A–E arrives at Station E (Visit 1).
• 10:00: Cannot visit D or F, and cannot loiter returns to Station A.
• 10:30: A–E is occupied by Team 1 Team 4 takes A–C to Station C.
• 11:00: Returns from Station C to Station A.
• 11:30: Traverses A–E arrives at Station E (Visit 2).
• 12:00: Returns to Station A.
• Station E Visit Count for Team 4:
• Team 4 passes through Station E at 09:30 and 11:30 Exactly 2 times.
• Numerical Answer:
• 2.
Topper Take
• Route Constraints for Team 4: Restricted entirely to {A, C, E}. Its trajectory is A–E–A–C–A–E–A, hitting E twice (09:30 and 11:30).
Other questions in this set
- Q11. Which one among the following stations is visited the largest number of times?
- Q12. How many times do the teams pass through Station B in a day?
- Q13. Which team patrols the street connecting Stations D and E at 10:15 hrs?
- Q15. How many teams pass through Station C in a day?
Routes & Networks questions from other CAT papers
- CAT 2022 Slot 1 DILR Q16
- CAT 2022 Slot 1 DILR Q17
- CAT 2022 Slot 1 DILR Q18
- CAT 2022 Slot 1 DILR Q19
- CAT 2022 Slot 1 DILR Q20
Practise this question with timing, notes and your mistake notebook.
Practise in PrepSoc