CAT 2023 Slot 3 DILR Q12
- Data Interpretation and Logical Reasoning
- Logical Reasoning › Routes & Networks
- Hard
- Type in the answer (TITA)
- CAT_2023_SLOT3_DILR_Q12
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 12
How many times do the teams pass through Station B 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
• Reachability and Edge Properties of Station B:
• Station B has only one connecting street: edge A–B (it is a terminal dead-end vertex).
• Any team visiting B must traverse A B A.
• Team Trajectories at Station B:
• Clue 6: Team 4 never visits Station B.
• Team 2 patrolled through F and E, never using A–B.
• Team 3 patrolled through C, D, and E, never using A–B.
• Team 1 patrolled: A B (arriving at 09:30) A (10:00), and A B (arriving at 11:30) A (12:00).
• Total Passages:
• Station B was visited exactly twice, both times by Team 1.
• Numerical Answer:
• 2.
Topper Take
• Dead-End Geometry: B is connected solely to A. Only Team 1 visits B (at 09:30 and 11:30), giving exactly 2 visits.
Other questions in this set
- Q11. Which one among the following stations is visited the largest number of times?
- Q13. Which team patrols the street connecting Stations D and E at 10:15 hrs?
- Q14. How many times does Team 4 pass through Station E in a day?
- 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