GATE ME 2022 Set 2 — Question 9

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.

MCQ+2 / -0.67HardNumerical Relations & ReasoningAnalytical AptitudeGeneral Aptitude

General Aptitude → Analytical Aptitude → Numerical Relations & Reasoning

Last updated 5 September 2026

Question

Four cities P, Q, R and S are connected through one-way routes as shown in the figure. The travel time between any two connected cities is one hour. The boxes beside each city name describe the starting time of first train of the day and their frequency of operation. For example, from city P, the first trains of the day start at 8 AM with a frequency of 90 minutes to each of R and S. A person does not spend additional time at any city other than the waiting time for the next connecting train. If the person starts from R at 7 AM and is required to visit S and return to R, what is the minimum time required?

Correct answer (A) 6 hours 30 minutes Solution 1. Analyze the Routes and Schedules: P: Outgoing to R and S. First train: 8:00 AM, Frequency: 90 min (8:00, 9:30, 11:00, 12:30, ...) Q: Outgoing to P and S. First train: 5:00 AM, Frequency: 120 min (5:00, 7:00, 9:00, 11:00, 13:00, ...) R: Outgoing to P and Q. First train: 7:00 AM, Frequency: 60 min (7:00, 8:00, 9:00, 10:00, ...) S: Outgoing to R and Q. First train: 8:00 AM, Frequency: 45 min (8:00, 8:45, 9:30, 10:15, 11:00, 11:45, 12:30, ...) Travel time for any route = 1 hour. 2. Find the path from R to S: Path R \to Q \to S: Leave R at 7:00 AM. Arrive Q at 8:00 AM. Next train from Q to S is at 9:00 AM. Arrive S at 10:00 AM. Path R \to P \to S: Leave R at 7:00 AM. Arrive P at 8:00 AM. Next train from P to S is at 8:00 AM. Arrive S at 9:00 AM. Best arrival at S is 9:00 AM. 3. Find the path from S back to R: From S (at 9:00 AM), the person can go to R or Q. Path S \to R: Next train from S to R is at 9:30 AM. Arrive R at 10:30 AM. Total time: 7:00 AM to 10:30 AM = 3.5 hours. (Not an option, re-check diagram arrows). 4. Re-evaluating the diagram arrows carefully: P \to R, P \to S Q \to P, Q \to R R \to Q, R \to P S \to Q, S \to P Note: There is no direct R \to S or S \to R. 5. Optimal Path Calculation: R to S: R \to Q \to S Leave R at 7:00 AM. Arrive Q at 8:00 AM. Wait for 9:00 AM train Q \to S. Arrive S at 10:00 AM. S to R: S \to Q \to R Leave S at 10:15 AM. Arrive Q at 11:15 AM. Wait for 1:00 PM train Q \to R. Arrive R at 2:00 PM. Total time: 7:00 AM to 2:00 PM = 7 hours. Alternative S to R: S \to P \to R Leave S at 10:15 AM. Arrive P at 11:15 AM. Wait for 12:30 PM train P \to R. Arrive R at 1:30 PM. Total time: 7:00 AM to 1:30 PM = 6 hours 30 minutes. Thus, the minimum time required is 6 hours 30 minutes. Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

Correct answer (A) 6 hours 30 minutes Solution 1. Analyze the Routes and Schedules: P: Outgoing to R and S. First train: 8:00 AM, Frequency: 90 min (8:00, 9:30, 11:00, 12:30, ...) Q: Outgoing to P and S. First train: 5:00 AM, Frequency: 120 min (5:00, 7:00, 9:00, 11:00, 13:00, ...) R: Outgoing to P and Q. First train: 7:00 AM, Frequency: 60 min (7:00, 8:00, 9:00, 10:00, ...) S: Outgoing to R and Q. First train: 8:00 AM, Frequency: 45 min (8:00, 8:45, 9:30, 10:15, 11:00, 11:45, 12:30, ...) Travel time for any route = 1 hour. 2. Find the path from R to S: Path R \to Q \to S: Leave R at 7:00 AM. Arrive Q at 8:00 AM. Next train from Q to S is at 9:00 AM. Arrive S at 10:00 AM. Path R \to P \to S: Leave R at 7:00 AM. Arrive P at 8:00 AM. Next train from P to S is at 8:00 AM. Arrive S at 9:00 AM. Best arrival at S is 9:00 AM. 3. Find the path from S back to R: From S (at 9:00 AM), the person can go to R or Q. Path S \to R: Next train from S to R is at 9:30 AM. Arrive R at 10:30 AM. Total time: 7:00 AM to 10:30 AM = 3.5 hours. (Not an option, re-check diagram arrows). 4. Re-evaluating the diagram arrows carefully: P \to R, P \to S Q \to P, Q \to R R \to Q, R \to P S \to Q, S \to P Note: There is no direct R \to S or S \to R. 5. Optimal Path Calculation: R to S: R \to Q \to S Leave R at 7:00 AM. Arrive Q at 8:00 AM. Wait for 9:00 AM train Q \to S. Arrive S at 10:00 AM. S to R: S \to Q \to R Leave S at 10:15 AM. Arrive Q at 11:15 AM. Wait for 1:00 PM train Q \to R. Arrive R at 2:00 PM. Total time: 7:00 AM to 2:00 PM = 7 hours. Alternative S to R: S \to P \to R Leave S at 10:15 AM. Arrive P at 11:15 AM. Wait for 12:30 PM train P \to R. Arrive R at 1:30 PM. Total time: 7:00 AM to 1:30 PM = 6 hours 30 minutes. Thus, the minimum time required is 6 hours 30 minutes.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE ME question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

Start with a free account View plans and allowances

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

GATE ME 2022 Set 2 — Question 9

Question

Correct answer

Solution

A step still unclear? Work through it with support

More questions on Analytical Aptitude