Analytical Reasoning Question No. 95
📍 In a province, there are eight cities which are connected through path for trade purpose.
🗺️ Path connections (undirected, bidirectional):
• Paths of city O are directly (without intermediate cities) to each of the cities F, G, J, and R;
• From R directly to each of the cities S and T;
• From J directly to the city M; and from M directly to T.
Note: Paths go to the center of each city, neither merge nor cross. Trade both directions. No further paths discovered. Shortest route = fewest intermediate cities.
• Paths of city O are directly (without intermediate cities) to each of the cities F, G, J, and R;
• From R directly to each of the cities S and T;
• From J directly to the city M; and from M directly to T.
Note: Paths go to the center of each city, neither merge nor cross. Trade both directions. No further paths discovered. Shortest route = fewest intermediate cities.
| Question | Multiple Choice Options |
|---|---|
| 1️⃣ On the network, a trader could have traveled between which pair by going through exactly one other city? | (A) F and M (B) F and T (C) G and T (D) M and S (E) R and M |
| 2️⃣ A trader must have gone through O to travel on the network from: | (A) F to G (B) J to T (C) M to S (D) R to T (E) S to T |
| 3️⃣ A trader going from J to all of the cities F, G, and T (not necessarily in that order) by a shortest route could have gone through which city exactly twice? | (A) F (B) M (C) O (D) R (E) T |
| 4️⃣ To make a trip from S to both F and M (not necessarily in order) without going through any intermediate city twice, a trader must have gone from: | (A) F to O (B) G to O (C) J to M (D) O to J (E) T to M |
| 5️⃣ To travel from R to all of the cities J, F, and S (not necessarily in order) by a route that is shortest overall, a trader could have gone first to: | (A) O and last to F (B) O and last to J (C) O and last to S (D) S and last to F (E) T and last to S |
| 6️⃣ If path O–J did not exist earlier, but exactly one additional path G–T existed (other paths remain), then during that earlier period a trader making which trip by shortest route could have passed through G? | (A) F to J (B) F to S (C) J to S (D) R to M (E) T to J |
✅ Correct Answers (Analytical Reasoning)
- Question 1: (D) M and S
- Question 2: (C) M to S
- Question 3: (C) O
- Question 4: (A) F to O
- Question 5: (A) O and last to F
- Question 6: (B) From F to S
🎯 Based on network adjacency & shortest path logic. Watch the video for detailed explanation.
