All Courses
Get the App Signup / Login
Sign in Open App
CAT Exam  >  CAT Tests  >  Logical Reasoning (LR) and Data Interpretation (DI)  >  Routes & Network - CAT MCQ

Routes & Network - CAT MCQ


Test Description

10 Questions MCQ Test Logical Reasoning (LR) and Data Interpretation (DI) - Routes & Network

Routes & Network for CAT 2024 is part of Logical Reasoning (LR) and Data Interpretation (DI) preparation. The Routes & Network questions and answers have been prepared according to the CAT exam syllabus.The Routes & Network MCQs are made for CAT 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Routes & Network below.
Solutions of Routes & Network questions in English are available as part of our Logical Reasoning (LR) and Data Interpretation (DI) for CAT & Routes & Network solutions in Hindi for Logical Reasoning (LR) and Data Interpretation (DI) course. Download more important topics, notes, lectures and mock test series for CAT Exam by signing up for free. Attempt Routes & Network | 10 questions in 20 minutes | Mock test for CAT preparation | Free important questions MCQ to study Logical Reasoning (LR) and Data Interpretation (DI) for CAT Exam | Download free PDF with solutions
Routes & Network - Question 1
Save

Punit lives in village A and want to visit nearby villages B, C, D, E and F. All villages are connected by two – way routes. The length of the route from A to B is 15 km, from B to F is 20 km, from F to A is 24 km, from F to E is 21 km, from C to F is 17 km, from B to C is 22 km, from C to E is 19 km, from E to D is 28 km, from D to C is 25 km. Select the maximum distance, in km, that Punit require to cover to visit all villages and return to A. 

Detailed Solution for Routes & Network - Question 1

The possible routes are as follows:

A - B - C - D - E - F - A = 15 + 22 + 25 + 28 + 21 + 24 = 135 km.
Since there is only one route which covers all villages and pass through a village only once.
Hence, 135 km is the correct answer.

Routes & Network - Question 2
Save

A road map connecting to the colonies P, Q, R, S and T is shown in the figure below. Design the route starting from any colony of your choice so that you will have to walk on each of the seven routes once and only once. The starting point and the end point may not be the same. From how many routes can such route be started?

Detailed Solution for Routes & Network - Question 2

The possible routes are as follows:

TQSRP

TPRSQ

TQPRS

TPQSR

Here, four such routes are possible.
Hence, four is the correct answer.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Routes & Network - Question 3
Save

Namisha took her four grandchildren for a tour in a theme park and they visited six sites. When she asked each of them to draw road maps that they used during their ride, they produced the following maps though all did not show exact relative positions of road connections. If only three maps are correct, then select the map with incorrect connections.  

Detailed Solution for Routes & Network - Question 3

On analyzing the options:
(1)

Here, there are six sites, one site with one route, four sites with two routes and one site with three routes.
(2)

Here, there are six sites, one site with one route, two sites with two routes and three sites with three routes
(3)

Here, there are six sites, one site with one route, two sites with two routes and three sites with three routes.
(4)

Here, there are six sites, one site with one route, two sites with two routes and three sites with three routes.
Hence, option 1 is the correct answer.

Routes & Network - Question 4
Save

Sateja took her four grandchildren for a car ride and they visited six junctions. When she asked each of them to draw road maps that they used during their ride, they produced the following maps though all did not show exact relative positions of road connections. If only three maps are correct, then select the map with incorrect connections.
Detailed Solution for Routes & Network - Question 4

Except for option(1), every map shows four 3-road junctions and two 2-road junctions while option(1) shows all junctions have 3-road junctions.
Hence the correct answer is an option(1) i.e.,

Routes & Network - Question 5
Save

A road map connecting to the colonies A, B, C, D and E is shown in the figure below. Design the route starting from any colony of your choice so that you will have to walk on each of the seven routes once and only once. The starting point and the end point may not be the same. From how many points, can such route be started?
Detailed Solution for Routes & Network - Question 5

For this question, we can take all points one by one.

Such route started from Point A: Yes it exists, route ACDEBDAB, etc.

Such route started from Point B: Yes it exist , route BADEBDCA, etc.

Such route started from Point C: No it does not exist.

Such route started from Point D: No it does not exist.

Such route started from Point E: No it does not exist.

So, such route is started only from two points i.e., A and B.

Hence, the correct answer is option(3)i.e. Two.

Routes & Network - Question 6
Save

There are six towns P, Q, R, S, T and U. They are connected as follows:

There are two one-way roads between P and Q. There are three one-way roads between Q and R. There is only one two-way road between R and T. S and T are connected by two way. Similarly, S and U are connected by two one-way road. Starting from Q if a person has to visit town S, how many ways are available?
Detailed Solution for Routes & Network - Question 6

1. There are two one-way roads between P and Q.
2. There are three one-way roads between Q and R.

3. There is only one two-way road between R and T.

4. S and T are connected by two two-way roads.
5. S and U are connected by two one-way road.

If a person has to visit town S, starting from two Q. There are six possible ways.

Hence, the correct answer is 6.

Routes & Network - Question 7
Save

In the following question, select the related figure from the given alternatives.
Detailed Solution for Routes & Network - Question 7

The movement of symbols is as follows:

The symbol at position 1 will duplicate and move at position 9 and 6. The symbol at position 9 will duplicate and place at 4 and 3. The symbol at position 3 will move at position 5. The symbol at position 5 will move at position 7. The symbol at position 7 will move at position 1. The final figure will be as follows: 

Routes & Network - Question 8
Save

Rohit live in city T and want to visit branch offices of his company in nearby cities P, Q, R and S. All cities are connected by two – way routes. The length of the route from T to P is 22 km, from P to R is 15 km, from R to Q is 26 km, from Q to P is 24 km, from Q to S is 19 km, from R to S is 17 km, from T to R is 25 km, and from T to S is 20 km. Select the maximum distance, in km, that Rohit require to cover to visit all branch offices and return to T.
Detailed Solution for Routes & Network - Question 8

The possible routes are as follows:

T - P - R - Q - S - T = 22 + 15 + 26 + 19 + 20 = 102 km
T - P - Q - R - S - T = 22 + 24 + 26 + 17 + 20 =  109 km
T - S - Q - R - P - T = 20 + 19 + 26 +15 + 22 = 102 km
T - S - R - Q - P - T =  20 + 17 + 26 + 24 + 22 =  109 km
Hence, 109 km is the correct answer.

Routes & Network - Question 9
Save

Ganesh took his four grandchildren for a car ride and they visited six stops. When he asked each of them to draw road maps that they used during their ride, they produced the following maps though all did not show exact relative positions of road connections. If only three maps are correct, then select the map with incorrect connections.
Detailed Solution for Routes & Network - Question 9

On analyzing the options:
(1)

Here, there six stops, one stop with one route, two stops with two routes, three stops with three routes.
(2)

Here, there six stops, one stop with one route, two stops with two routes, three stops with three routes.
(3)

Here, there six stops, one stop with one route, two stops with two routes, three stops with three routes.
(4)

Here, there six stops, one stop with one route, four stops with two routes, one stop with three routes.

In each of the given options figure 4 is not the same as others.

Hence, option 4 is the correct answer.

Routes & Network - Question 10
Save

I live in a village Pali and I want to visit my therapy clients living in nearby villages Neli, Teli and Seli. All villages are connected by two-way routes. The length of the route from Pali to Neli is 31 km, from Teli to Pali is 20 km, from Seli to Pali is 22 km, from Neli to Teli is 16 km, from Teli to Seli 18 km, and from Seli to Neli is 26 km long. Select. the minimum distance, in km, that I require to cover to visit my clients and return to Pali.
Detailed Solution for Routes & Network - Question 10


There are six possibilities to visit clients and return to pali.

(1) Pali - Neli - Seli - Teli - Pali

Distance = 31 Km + 26 Km + 18 Km + 20 Km = 95 Km

(2) Pali - Neli - Teli - Seli - Pali

Distance = 31 Km + 16 Km + 18 Km + 22 Km = 87 Km

(3) Pali - Teli - Neli - Seli - Pali

Distance = 20 Km + 16 Km + 26 Km + 22 Km = 84 Km

(4) Pali - Teli - Seli - Neli - Pali

Distance = 20 Km + 18 Km + 26 Km + 31 Km = 95 Km

(5) Pali - Seli - Neli - Teli - Pali

Distance = 22 Km + 26 Km + 16 Km + 20 Km = 84 Km

(6) Pali - Seli - Teli - Neli - Pali

Distance = 22 Km + 18 Km + 16 Km + 31 Km = 87 Km

So, the minimum distance to visit clients and return to pali is 84 Km.

Hence, the correct answer is option(1) i.e., 84 Km.

88 videos|119 docs|91 tests
Join Course
Information about Routes & Network Page
In this test you can find the Exam questions for Routes & Network solved & explained in the simplest way possible. Besides giving Questions and answers for Routes & Network, EduRev gives you an ample number of Online tests for practice

Top Courses for CAT

Download as PDF

Top Courses for CAT

Important Questions for Routes & Network

Find all the important questions for Routes & Network at EduRev.Get fully prepared for Routes & Network with EduRev's comprehensive question bank and test resources. Our platform offers a diverse range of question papers covering various topics within the Routes & Network syllabus. Whether you need to review specific subjects or assess your overall readiness, EduRev has you covered. The questions are designed to challenge you and help you gain confidence in tackling the actual exam. Maximize your chances of success by utilizing EduRev's extensive collection of Routes & Network resources.

Routes & Network MCQs with Answers

Prepare for the Routes & Network within the CAT exam with comprehensive MCQs and answers at EduRev. Our platform offers a wide range of practice papers, question papers, and mock tests to familiarize you with the exam pattern and syllabus. Access the best books, study materials, and notes curated by toppers to enhance your preparation. Stay updated with the exam date and receive expert preparation tips and paper analysis. Visit EduRev's official website today and access a wealth of videos and coaching resources to excel in your exam.

Online Tests for Routes & Network Logical Reasoning (LR) and Data Interpretation (DI)

Practice with a wide array of question papers that follow the exam pattern and syllabus. Our platform offers a user-friendly interface, allowing you to track your progress and identify areas for improvement. Access detailed solutions and explanations for each test to enhance your understanding of concepts. With EduRev's Online Tests, you can build confidence, boost your performance, and ace Routes & Network with ease. Join thousands of successful students who have benefited from our trusted online resources.
© EduRev
Education Revolution
Follow Us
Signup to see your scores go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup