Top 13 CAT Routes and Networks Questions With Video Solutions

Practice Routes and Networks questions for CAT with detailed video and text solutions. Questions from Routes and Networks though not consistent in the CAT but the concepts are still important for all the mba entrance exams. Practice questions from CAT Previous Papers to get a fare understanding of the type of questions being asked in the exam across the years. These type of questions also appear in various other entrance exams such as NMAT etc. Practice becomes the sole key for mastering questions from these topic and hence we request the students to make the best use of our resources.  

CAT Routes and Networks Questions Weightage Over Past 4 Years

Year

No. of Sets

2023

1

2022

2

2021

0

2020

0

CAT 2023 Routes And Networks questions

Instruction for set 1:

Comprehension:
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.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.

Question 1

Which one among the following stations is visited the largest number of times?


Instruction for set 1:

Comprehension:
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.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.

Question 2

How many times do the teams pass through Station B in a day?


Instruction for set 1:

Comprehension:
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.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.

Question 3

Which team patrols the street connecting Stations D and E at 10:15 hrs?


Instruction for set 1:

Comprehension:
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.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.

Question 4

How many times does Team 4 pass through Station E in a day?


Instruction for set 1:

Comprehension:
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.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.

Question 5

How many teams pass through Station C in a day?

CAT 2017 Routes And Networks questions

Instruction for set 1:

Four cars need to travel from Akala (A) to Bakala (B). Two routes are available, one via Mamur (M) and the other via Nanur (N). The roads from A to M, and from N to B, are both short and narrow. In each case, one car takes 6 minutes to cover the distance, and each additional car increases the travel time per car by 3 minutes because of congestion. (For example, if only two cars drive from A to M, each car takes 9 minutes.) On the road from A to N, one car takes 20 minutes, and each additional car increases the travel time per car by 1 minute. On the road from M to B, one car takes 20 minutes, and each additional car increases the travel time per car by 0.9 minute.
The police department orders each car to take a particular route in such a manner that it is not possible for any car to reduce its travel time by not following the order, while the other cars are following the order.

Question 1

How many cars would be asked to take the route A-N-B, that is Akala-Nanur-Bakala route, by the police department?


Instruction for set 1:

Four cars need to travel from Akala (A) to Bakala (B). Two routes are available, one via Mamur (M) and the other via Nanur (N). The roads from A to M, and from N to B, are both short and narrow. In each case, one car takes 6 minutes to cover the distance, and each additional car increases the travel time per car by 3 minutes because of congestion. (For example, if only two cars drive from A to M, each car takes 9 minutes.) On the road from A to N, one car takes 20 minutes, and each additional car increases the travel time per car by 1 minute. On the road from M to B, one car takes 20 minutes, and each additional car increases the travel time per car by 0.9 minute.
The police department orders each car to take a particular route in such a manner that it is not possible for any car to reduce its travel time by not following the order, while the other cars are following the order.

Question 2

If all the cars follow the police order, what is the difference in travel time (in minutes) between a car which takes the route A-N-B and a car that takes the route A-M-B?


Instruction for set 1:

Four cars need to travel from Akala (A) to Bakala (B). Two routes are available, one via Mamur (M) and the other via Nanur (N). The roads from A to M, and from N to B, are both short and narrow. In each case, one car takes 6 minutes to cover the distance, and each additional car increases the travel time per car by 3 minutes because of congestion. (For example, if only two cars drive from A to M, each car takes 9 minutes.) On the road from A to N, one car takes 20 minutes, and each additional car increases the travel time per car by 1 minute. On the road from M to B, one car takes 20 minutes, and each additional car increases the travel time per car by 0.9 minute.
The police department orders each car to take a particular route in such a manner that it is not possible for any car to reduce its travel time by not following the order, while the other cars are following the order.

Question 3

A new one-way road is built from M to N. Each car now has three possible routes to travel from A to B: A-M-B, A-N-B and A-M-N-B. On the road from M to N, one car takes 7 minutes and each additional car increases the
travel time per car by 1 minute. Assume that any car taking the A-M-N-B route travels the A-M portion at the same time as other cars taking the A-M-B route, and the N-B portion at the same time as other cars taking the A-N-B route.
How many cars would the police department order to take the A-M-N-B route so that it is not possible for any car to reduce its travel time by not following the order while the other cars follow the order? (Assume that the police department would never order all the cars to take the same route.)


Instruction for set 1:

Four cars need to travel from Akala (A) to Bakala (B). Two routes are available, one via Mamur (M) and the other via Nanur (N). The roads from A to M, and from N to B, are both short and narrow. In each case, one car takes 6 minutes to cover the distance, and each additional car increases the travel time per car by 3 minutes because of congestion. (For example, if only two cars drive from A to M, each car takes 9 minutes.) On the road from A to N, one car takes 20 minutes, and each additional car increases the travel time per car by 1 minute. On the road from M to B, one car takes 20 minutes, and each additional car increases the travel time per car by 0.9 minute.
The police department orders each car to take a particular route in such a manner that it is not possible for any car to reduce its travel time by not following the order, while the other cars are following the order.

Question 4

A new one-way road is built from M to N. Each car now has three possible routes to travel from A to B: A-M-B, A-N-B and A-M-N-B. On the road from M to N, one car takes 7 minutes and each additional car increases the travel time per car by j. minute. Assume that any car taking the A-M-N-B route travels the A-M portion at the same time as other cars taking the A-M-B route, and the N-B portion at the same time as other cars taking the A-N-B route.
If all the cars follow the police order, what is the minimum travel time (in minutes) from A to B? (Assume that the police department would never order all the cars to take the same route.)


Instruction for set 2:

A new airlines company is planning to start operations in a country. The company has identified ten different cities which they plan to connect through their network to start with. The flight duration between any pair of cities will be less than one hour. To start operations, the company has to decide on a daily schedule.
The underlying principle that they are working on is the following:
Any person staying in any of these 10 cities should be able to make a trip to any other city in the morning and should be able to return by the evening of the same day.

Question 5

If the underlying principle is to be satisfied in such a way that the journey between any two cities can be performed using only direct (non-stop) flights, then the minimum number of direct flights to be scheduled is:


Instruction for set 2:

A new airlines company is planning to start operations in a country. The company has identified ten different cities which they plan to connect through their network to start with. The flight duration between any pair of cities will be less than one hour. To start operations, the company has to decide on a daily schedule.
The underlying principle that they are working on is the following:
Any person staying in any of these 10 cities should be able to make a trip to any other city in the morning and should be able to return by the evening of the same day.

Question 6

Suppose three of the ten cities are to be developed as hubs. A hub is a city which is connected with every other city by direct flights each way, both in the morning as well as in the evening. The only direct flights which will be scheduled are originating and/or terminating in one of the hubs. Then the minimum number of direct flights that need to be scheduled so that the underlying principle of the airline to serve all the ten cities is met without visiting more than one hub during one trip is:


Instruction for set 2:

A new airlines company is planning to start operations in a country. The company has identified ten different cities which they plan to connect through their network to start with. The flight duration between any pair of cities will be less than one hour. To start operations, the company has to decide on a daily schedule.
The underlying principle that they are working on is the following:
Any person staying in any of these 10 cities should be able to make a trip to any other city in the morning and should be able to return by the evening of the same day.

Question 7

Suppose the 10 cities are divided into 4 distinct groups G1, G2, G3, G4 having 3, 3, 2 and 2 cities respectively and that G1 consists of cities named A, B and C. Further, suppose that direct flights are allowed only between two cities satisfying one of the following:
1. Both cities are in G1
2. Between A and any city in G2
3. Between B and any city in G3
4. Between C and any city in G4
Then the minimum number of direct flights that satisfies the underlying principle of the airline is:


Instruction for set 2:

A new airlines company is planning to start operations in a country. The company has identified ten different cities which they plan to connect through their network to start with. The flight duration between any pair of cities will be less than one hour. To start operations, the company has to decide on a daily schedule.
The underlying principle that they are working on is the following:
Any person staying in any of these 10 cities should be able to make a trip to any other city in the morning and should be able to return by the evening of the same day.

Question 8

Suppose the 10 cities are divided into 4 distinct groups Gl, G2, G3, G4 having 3, 3, 2 and 2 cities respectively and that Gl consists of cities named A, B and C. Further, suppose that direct flights are allowed only between two cities satisfying one of the following:
1. Both cities are in G1
2. Between A and any city in G2
3. Between B and any city in G3
4. Between C and any city in G4
However, due to operational difficulties at A, it was later decided that the only flights that would operate at A would be those to and from B. Cities in G2 would have to be assigned to G3 or to G4.
What would be the maximum reduction in the number of direct flights as compared to the situation before the operational difficulties arose?

CAT Quant Questions | CAT Quantitative Ability

CAT Profit And Loss QuestionsCAT Remainders QuestionsCAT Functions, Graphs and Statistics QuestionsCAT Arithmetic QuestionsCAT Inequalities QuestionsCAT Averages Mixtures Alligations QuestionsCAT Number Series QuestionsCAT Geometry QuestionsCAT Probability, Combinatorics QuestionsCAT Averages QuestionsCAT Venn Diagrams QuestionsCAT Time And Work QuestionsCAT Percentages QuestionsCAT Data Sufficiency QuestionsCAT Simple Interest Compound Interest QuestionsCAT Logarithms, Surds and Indices QuestionsCAT Time Speed Distance QuestionsCAT Progressions and Series QuestionsCAT Quadratic Equations QuestionsCAT Profit, Loss and Interest QuestionsCAT Logarithms QuestionsCAT Coordinate Geometry QuestionsCAT Number Systems QuestionsCAT Time, Distance and Work QuestionsCAT Linear Equations QuestionsCAT Algebra QuestionsCAT Averages, Ratio and Proportion QuestionsCAT Mensuration Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Verbal Ability Questions | VARC Questions For CAT

cracku

Boost your Prep!

Download App