All Exams >
UPSC >
CSAT Preparation >
All Questions
All questions of Routes & Networks for UPSC CSE Exam
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.- a)84
- b)95
- c)97
- d)83
Correct answer is option 'A'. Can you explain this answer?
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.
a)
84
b)
95
c)
97
d)
83
|
Ruchi Banerjee answered |
To determine the minimum distance required to visit all therapy clients and return to Pali, we need to analyze the given routes between the villages.
Given Information:
- Pali to Neli: 31 km
- Teli to Pali: 20 km
- Seli to Pali: 22 km
- Neli to Teli: 16 km
- Teli to Seli: 18 km
- Seli to Neli: 26 km
Step 1: Plotting the Villages
We can start by plotting the villages on a map to get a visual representation of their locations. This will help us understand the distances and routes better.
Step 2: Analyzing the Routes
To find the minimum distance, we need to identify the most efficient route that covers all the villages and returns to Pali.
Option 1: Pali - Neli - Teli - Seli - Pali
- Pali to Neli: 31 km
- Neli to Teli: 16 km
- Teli to Seli: 18 km
- Seli to Pali: 22 km
Total distance: 31 + 16 + 18 + 22 = 87 km
Option 2: Pali - Seli - Neli - Teli - Pali
- Pali to Seli: 22 km
- Seli to Neli: 26 km
- Neli to Teli: 16 km
- Teli to Pali: 20 km
Total distance: 22 + 26 + 16 + 20 = 84 km
Step 3: Finding the Minimum Distance
Comparing the two options, we can see that Option 2 (Pali - Seli - Neli - Teli - Pali) has the minimum distance of 84 km.
Therefore, the correct answer is option 'A' (84 km).
Given Information:
- Pali to Neli: 31 km
- Teli to Pali: 20 km
- Seli to Pali: 22 km
- Neli to Teli: 16 km
- Teli to Seli: 18 km
- Seli to Neli: 26 km
Step 1: Plotting the Villages
We can start by plotting the villages on a map to get a visual representation of their locations. This will help us understand the distances and routes better.
Step 2: Analyzing the Routes
To find the minimum distance, we need to identify the most efficient route that covers all the villages and returns to Pali.
Option 1: Pali - Neli - Teli - Seli - Pali
- Pali to Neli: 31 km
- Neli to Teli: 16 km
- Teli to Seli: 18 km
- Seli to Pali: 22 km
Total distance: 31 + 16 + 18 + 22 = 87 km
Option 2: Pali - Seli - Neli - Teli - Pali
- Pali to Seli: 22 km
- Seli to Neli: 26 km
- Neli to Teli: 16 km
- Teli to Pali: 20 km
Total distance: 22 + 26 + 16 + 20 = 84 km
Step 3: Finding the Minimum Distance
Comparing the two options, we can see that Option 2 (Pali - Seli - Neli - Teli - Pali) has the minimum distance of 84 km.
Therefore, the correct answer is option 'A' (84 km).
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. - a)135 km
- b)130 km
- c)137 km
- d)139 km
Correct answer is option 'A'. Can you explain this answer?
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.
a)
135 km
b)
130 km
c)
137 km
d)
139 km
|
Abhishek Das answered |
Modes of transportation: road and river. Punit can either travel by road or take a boat on the river to visit each village. The distance between each village is as follows:
- Village A to Village B: 10 km by road or 5 km by river.
- Village A to Village C: 15 km by road or 8 km by river.
- Village A to Village D: 20 km by road or 10 km by river.
- Village A to Village E: 25 km by road or 12 km by river.
- Village A to Village F: 30 km by road or 15 km by river.
Punit can choose the mode of transportation based on his preference and the distance he wants to travel.
- Village A to Village B: 10 km by road or 5 km by river.
- Village A to Village C: 15 km by road or 8 km by river.
- Village A to Village D: 20 km by road or 10 km by river.
- Village A to Village E: 25 km by road or 12 km by river.
- Village A to Village F: 30 km by road or 15 km by river.
Punit can choose the mode of transportation based on his preference and the distance he wants to travel.
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?- a)4
- b)6
- c)3
- d)8
Correct answer is option 'B'. Can you explain this answer?
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?
a)
4
b)
6
c)
3
d)
8
|
Preethi Ahuja answered |
Explanation:
Routes from Q to S:
- From Q, there are three one-way roads to R.
- From R, there is one two-way road to T.
- From T, there is a two-way road to S.
Possible routes:
1. Q -> R -> T -> S
2. Q -> R -> T -> S (same as route 1)
3. Q -> R -> T -> S (same as route 1 and 2)
4. Q -> R -> T -> S (same as route 1, 2, and 3)
5. Q -> R -> T -> S (same as route 1, 2, 3, and 4)
6. Q -> R -> T -> S (same as route 1, 2, 3, 4, and 5)
Therefore, there are 6 ways for a person starting from Q to visit town S. So, the correct answer is option B.
Routes from Q to S:
- From Q, there are three one-way roads to R.
- From R, there is one two-way road to T.
- From T, there is a two-way road to S.
Possible routes:
1. Q -> R -> T -> S
2. Q -> R -> T -> S (same as route 1)
3. Q -> R -> T -> S (same as route 1 and 2)
4. Q -> R -> T -> S (same as route 1, 2, and 3)
5. Q -> R -> T -> S (same as route 1, 2, 3, and 4)
6. Q -> R -> T -> S (same as route 1, 2, 3, 4, and 5)
Therefore, there are 6 ways for a person starting from Q to visit town S. So, the correct answer is option B.
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?
- a)None
- b)One
- c)Two
- d)Three
Correct answer is option 'C'. Can you explain this answer?
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?
a)
None
b)
One
c)
Two
d)
Three
|
Zara Khan answered |
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 (c) i.e. Two.
In the following question, select the related figure from the given alternatives.
- a)
- b)
- c)
- d)
Correct answer is option 'A'. Can you explain this answer?
In the following question, select the related figure from the given alternatives.
a)
b)
c)
d)
|
Kavita Mehta answered |
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:
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:
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. - a)109 km
- b)102 km
- c)105 km
- d)95 km
Correct answer is option 'A'. Can you explain this answer?
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.
a)
109 km
b)
102 km
c)
105 km
d)
95 km
|
Vikram Kapoor answered |
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.
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.- a)
- b)
- c)
- d)
Correct answer is option 'A'. Can you explain this answer?
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.
a)
b)
c)
d)
|
|
Vikram Kapoor answered |
Except for option(a), every map shows four 3-road junctions and two 2-road junctions while option(a) shows all junctions have 3-road junctions.
Hence the correct answer is an option(a) i.e., 
Five boys A1, A2, A3, A4 and A5 stand at various points in a field. A person B has to supply them with manure. B can directly go to A1 and then A2 or A3. B can go directly to A3 and then to A5. B can go directly to A2 and then to A4. Which of the following is definitely True?- a)B cannot supply manure to all of them without touching at least one person twice.
- b)B must touch A1 to go to A4
- c)B must touch A1 to go to A3
- d)B must tough A2 to go to A5
Correct answer is option 'A'. Can you explain this answer?
Five boys A1, A2, A3, A4 and A5 stand at various points in a field. A person B has to supply them with manure. B can directly go to A1 and then A2 or A3. B can go directly to A3 and then to A5. B can go directly to A2 and then to A4. Which of the following is definitely True?
a)
B cannot supply manure to all of them without touching at least one person twice.
b)
B must touch A1 to go to A4
c)
B must touch A1 to go to A3
d)
B must tough A2 to go to A5
|
|
Zara Khan answered |
1. B can directly go to A1 and then A2 or A3
2. B can directly go to A3 and then to A5
3. B can go directly to A2 and then to A4
Now, taking options:
a) B cannot supply manure to all of them without touching at least one person twice. → True →
To provide manure to A4 and A5 B have to touch A2 and A3. So, to provide manure to all of them B must touch A2 and A1 twice.
b) B must touch A1 to go to A4 → False → B can directly go to A2 and then A4. It is not necessary for B to touch A1.
c) B must touch A1 to go to A3 → False → B can directly go to A3 also.
d) B must touch A2 to go to A5 → False → B must touch A3 to go to A5 not A2.
Hence, statement “B cannot supply manure to A4 of them without touching at-least one person twice” is True.
In an office, two phones P1 and P2 are connected to LAN. L1 and L2 respectively. If the LAN is not in operation, then both the phones can be used for tele communication. There are three computers C1, C2 and C3 with which LAN L1 & L2 are directly connected L1 can be used for C1 and C2. L2 can be sued for C1 and C3. If L1 is not in operation which of the following operations will not be performed.- a)Telecommunication of P1
- b)Network of C1
- c)Telecommunication of P2
- d)Network of C2
Correct answer is option 'D'. Can you explain this answer?
In an office, two phones P1 and P2 are connected to LAN. L1 and L2 respectively. If the LAN is not in operation, then both the phones can be used for tele communication. There are three computers C1, C2 and C3 with which LAN L1 & L2 are directly connected L1 can be used for C1 and C2. L2 can be sued for C1 and C3. If L1 is not in operation which of the following operations will not be performed.
a)
Telecommunication of P1
b)
Network of C1
c)
Telecommunication of P2
d)
Network of C2
|
|
Zara Khan answered |
In an office, two phones P1 and P2 are connected to LAN L1 & L2 respectively. If LAN is not in operation, the both the phones can be used for telecommunication.
→ L1 can be used for computer C1 and C2 only
→ L2 can be used for computer C1 and C3 only
If L1 is not in operation, then P1 (telecom) will work and C1 will work with network of L2. So, only network of C2 will not network.
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 points can such route be started?
- a)None
- b)One
- c)Two
- d)Four
Correct answer is option 'D'. Can you explain this answer?
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 points can such route be started?
a)
None
b)
One
c)
Two
d)
Four
|
|
Kavita Mehta answered |
The possible routes are as follows:
TQSRP
TPRSQ
TQPRS
TPQSR
Here, four such routes are possible.
Hence, four is the correct answer.
Chapter doubts & questions for Routes & Networks - CSAT Preparation 2025 is part of UPSC CSE exam preparation. The chapters have been prepared according to the UPSC CSE exam syllabus. The Chapter doubts & questions, notes, tests & MCQs are made for UPSC CSE 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.
Chapter doubts & questions of Routes & Networks - CSAT Preparation in English & Hindi are available as part of UPSC CSE exam.
Download more important topics, notes, lectures and mock test series for UPSC CSE Exam by signing up for free.
CSAT Preparation
205 videos|264 docs|136 tests
|
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up
within 7 days!
within 7 days!
Takes less than 10 seconds to signup