Mechanical Engineering > GATE 2022 SET-2 > Travel Time
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?
A
6 hours 30 minutes
B
3 hours 45 minutes
C
4 hours 30 minutes
D
5 hours 15 minutes

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science