CAT Exam > CAT Questions > Directions: Read the given information carefu...
Start Learning for Free
Directions: Read the given information carefully and answer the question that follows.
A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.
The following information is known about the distances between the enemy camps:
1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.
2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.
3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.
4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.
5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.
6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.
7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.
A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.
The following information is known about the distances between the enemy camps:
1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.
2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.
3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.
4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.
5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.
6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.
7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.
If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover is
- a)110
- b)140
- c)160
- d)170
Correct answer is option 'B'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Directions: Read the given information carefully and answer the questi...
Let the length of the roads be as shown below.
From (iii), we have FR-4 - FR-7 = g = 30, and from (vi), we have FR-3 - FR-6 = f > 110
From (i), FR-4 - FR-6 = 90
The possible routes are FR-4 - FR-7 - FR-6 and FR-4 - FR-3 - FR-6.
For the route FR-4 - FR-7 - FR-6,
g + i = 90
For the route FR-4 - FR-3 - FR-6,
d + f = 90
But, this is not possible since the value of f is greater than 110.
Therefore, the route FR-4 - FR-7 - FR-6 is taken.
Now, g + i = 90 ⇒ i = 60
From (i), FR-2 - FR-6 = 30
Shortest route is FR-2 - FR-5 - FR-6, i.e.
e + j = 30 ⇒ (e, j) = (10, 20) or (20, 10)
From (v), FR-3 - FR-7 = 110
The possible routes are FR-3 - FR-4 - FR-7 and FR-3 - FR-6 - FR-7.
For the route FR-3 - FR-4 - FR-7,
d + g = 110
For the route FR-3 - FR-6 - FR-7,
i + f = 110
But, this is not possible since the value of f is greater than 110.
Therefore, the route FR-3 - FR-4 - FR-7 is taken.
Now, d + g = 110 ⇒ d = 80
From (iv), FR-5 - FR-6 + FR-5 - FR-7 = 100, i.e.
h + j = 100
Since j can only be 20 or 10, the possibilities for (h, j) are only (90, 10) and (80, 20).
But the lengths 80, 30, and 60 are already taken, and the length of the roads are distinct integers. So, the only possible case, (h, j) = (90, 10), implies e = 20.
From (v), FR-7 - FR-2 = 70
The possible routes are FR-7 - FR-4 - FR-2 and FR-7 - FR-5 - FR-2.
For the route FR-7 - FR-4 - FR-2,
g + c =70 ⇒ c = 40
For the route FR-7 - FR-5 - FR-2,
e + h = 70
But, this is not possible since the value of e + h is 110.
Therefore, for FR-7 - FR-2, the route FR-7 - FR-4 - FR-2 is taken.
From (vii), FR-1 - FR-4 = 110
The possible routes are FR-1 - FR-2 - FR-4 and FR-1 - FR-3 - FR-4.
For the route FR-1 - FR-2 - FR-4,
a + c = 110
⇒ a = 70
For the route FR-1 - FR-3 - FR-4,
b + d = 110
b = 110 - 80 = 30
But, this is not possible since the length of each road is unique.
Therefore, the route FR-1 - FR-2 - FR-4 is taken.
From (vii), FR-2 - FR-3 = 240
The possible routes are FR-2 - FR-1 - FR-3 and FR-2 - FR-4 - FR-3.
For the route FR-2 - FR-1 - FR-3,
a + b = 240
b = 170
For the route FR-2 - FR-4 - FR-3,
c + d = 240
But, this is not possible since the value of c + d is 120.
Therefore, the route FR-2 - FR-1 - FR-3 is taken.
From (ii), FR-1 - FR-7 = 360 (Longest path)
The possible routes for this are FR-1 - FR-2 - FR-4 - FR-7.
a + c + g = 360
But a + c + g = 140
This is not the longest path.
FR-1 - FR-2 - FR-5 - FR-7
a + e + h = 360
But, a + e + h = 180 (Not the longest path)
FR-1 - FR-3 - FR-4 - FR-7
b + d + g= 360
But b + d + g = 280 (Not the longest path)
The only possibility is FR-1 - FR-3 - FR-6 - FR-7.
b + f + i = 360
f = 130
The final network is as follows:
The spy would take the shortest path from FR-1 - FR-7, which is FR-1- FR-2 - FR-4 - FR-7.
Length of the shortest path = 70 + 40 + 30 = 140
From (iii), we have FR-4 - FR-7 = g = 30, and from (vi), we have FR-3 - FR-6 = f > 110
From (i), FR-4 - FR-6 = 90
The possible routes are FR-4 - FR-7 - FR-6 and FR-4 - FR-3 - FR-6.
For the route FR-4 - FR-7 - FR-6,
g + i = 90
For the route FR-4 - FR-3 - FR-6,
d + f = 90
But, this is not possible since the value of f is greater than 110.
Therefore, the route FR-4 - FR-7 - FR-6 is taken.
Now, g + i = 90 ⇒ i = 60
From (i), FR-2 - FR-6 = 30
Shortest route is FR-2 - FR-5 - FR-6, i.e.
e + j = 30 ⇒ (e, j) = (10, 20) or (20, 10)
From (v), FR-3 - FR-7 = 110
The possible routes are FR-3 - FR-4 - FR-7 and FR-3 - FR-6 - FR-7.
For the route FR-3 - FR-4 - FR-7,
d + g = 110
For the route FR-3 - FR-6 - FR-7,
i + f = 110
But, this is not possible since the value of f is greater than 110.
Therefore, the route FR-3 - FR-4 - FR-7 is taken.
Now, d + g = 110 ⇒ d = 80
From (iv), FR-5 - FR-6 + FR-5 - FR-7 = 100, i.e.
h + j = 100
Since j can only be 20 or 10, the possibilities for (h, j) are only (90, 10) and (80, 20).
But the lengths 80, 30, and 60 are already taken, and the length of the roads are distinct integers. So, the only possible case, (h, j) = (90, 10), implies e = 20.
From (v), FR-7 - FR-2 = 70
The possible routes are FR-7 - FR-4 - FR-2 and FR-7 - FR-5 - FR-2.
For the route FR-7 - FR-4 - FR-2,
g + c =70 ⇒ c = 40
For the route FR-7 - FR-5 - FR-2,
e + h = 70
But, this is not possible since the value of e + h is 110.
Therefore, for FR-7 - FR-2, the route FR-7 - FR-4 - FR-2 is taken.
From (vii), FR-1 - FR-4 = 110
The possible routes are FR-1 - FR-2 - FR-4 and FR-1 - FR-3 - FR-4.
For the route FR-1 - FR-2 - FR-4,
a + c = 110
⇒ a = 70
For the route FR-1 - FR-3 - FR-4,
b + d = 110
b = 110 - 80 = 30
But, this is not possible since the length of each road is unique.
Therefore, the route FR-1 - FR-2 - FR-4 is taken.
From (vii), FR-2 - FR-3 = 240
The possible routes are FR-2 - FR-1 - FR-3 and FR-2 - FR-4 - FR-3.
For the route FR-2 - FR-1 - FR-3,
a + b = 240
b = 170
For the route FR-2 - FR-4 - FR-3,
c + d = 240
But, this is not possible since the value of c + d is 120.
Therefore, the route FR-2 - FR-1 - FR-3 is taken.
From (ii), FR-1 - FR-7 = 360 (Longest path)
The possible routes for this are FR-1 - FR-2 - FR-4 - FR-7.
a + c + g = 360
But a + c + g = 140
This is not the longest path.
FR-1 - FR-2 - FR-5 - FR-7
a + e + h = 360
But, a + e + h = 180 (Not the longest path)
FR-1 - FR-3 - FR-4 - FR-7
b + d + g= 360
But b + d + g = 280 (Not the longest path)
The only possibility is FR-1 - FR-3 - FR-6 - FR-7.
b + f + i = 360
f = 130
The final network is as follows:
The spy would take the shortest path from FR-1 - FR-7, which is FR-1- FR-2 - FR-4 - FR-7.
Length of the shortest path = 70 + 40 + 30 = 140
Attention CAT Students!
To make sure you are not studying endlessly, EduRev has designed CAT study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in CAT.
|
Explore Courses for CAT exam
|
|
Top Courses for CATView all
Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer?
Question Description
Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? for CAT 2024 is part of CAT preparation. The Question and answers have been prepared according to the CAT exam syllabus. Information about Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for CAT 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer?.
Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? for CAT 2024 is part of CAT preparation. The Question and answers have been prepared according to the CAT exam syllabus. Information about Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for CAT 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer?.
Solutions for Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for CAT.
Download more important topics, notes, lectures and mock test series for CAT Exam by signing up for free.
Here you can find the meaning of Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Directions: Read the given information carefully and answer the question that follows.A spy of XYZ kingdom regularly spies between seven enemy camps that are located inside a forest, and are connected to each other by forest roads, FR–1, FR–2, FR–3, FR–4, FR–5, FR–6, and FR–7. The spy has made a map so that he can travel with ease between camps and get the useful information required. However, while travelling between any two enemy camps, the spy always chooses the route which passes through the minimum possible number of enemy camps. If two or more routes pass through the minimum number of enemy camps, he chooses the route for which the distance is also the least. The length of the forest road, directly connecting any two enemy camps, is a multiple of 10. For any pair of enemy camps, the length of a route connecting the two enemy camps and passing through the minimum possible number of enemy camps, is called a forest road stretch between the two enemy camps. The least among all the forest road stretches between two enemy camps is called the minimum forest road stretch between the two enemy camps.The following information is known about the distances between the enemy camps:1. The minimum forest road stretch between FR–4 and FR–6 is 90 miles, while the minimum forest road stretch between FR–2 and FR–6 is 30 miles.2. The highest forest road stretch between FR–1 and FR–7 is 360 miles.3. The minimum forest road stretch between FR–4 and FR–7 is 30 miles.4. The sum of the lengths of the road directly connecting FR–5 to FR–6 and that directly connecting FR–5 and FR–7 is 100 miles.5. The minimum forest road stretch between FR–7 and FR–2 is 70 miles, while the minimum forest road stretch between FR–3 and FR–7 is 110 miles.6. The length of the road directly connecting FR–3 and FR–6 is greater than 110 miles.7. The minimum forest road stretch between FR–1 and FR–4 is 110 miles, while the highest forest road stretch between FR–2 and FR–3 is 240 miles.If the spy has to travel from FR-1 to FR-7, the distance (in miles) that the spy would have to cover isa)110b)140c)160d)170Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice CAT tests.
|
|
Explore Courses for CAT exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© 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