ReasoningAbility.com

Transportation Schedule Beginner-Intermediate Worksheet: Focus on common variations practice Transportation Schedule BEGINNER INTERMEDIATE

Level up your Transportation Schedule skills! You're at Worksheet 4 of 10 (33% through this series). This step-up challenge worksheet features 20 beginner-intermediate-level problems with a focus on common variations practice. Topics covered: transportation schedule for competitive exams, how to solve transportation schedule, transportation schedule tricks.

📝 Worksheet 4 of 10 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Beginner Intermediate level

What you'll learn in this worksheet:
Your progress through Transportation Schedule
Worksheet 4 of 10 (33% complete)

Question 1

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 12:56 PM - T2: City A to City C, Departs 07:30, Arrives 10:31 AM - T3: City B to City E, Departs 15:00, Arrives 5:41 PM - T4: City B to City C, Departs 11:30, Arrives 2:29 PM - T5: City C to City E, Departs 10:30, Arrives 12:18 PM - T6: City C to City B, Departs 13:30, Arrives 4:14 PM - T7: City D to City E, Departs 11:30, Arrives 2:27 PM - T8: City D to City B, Departs 12:00, Arrives 2:11 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (10:00 - 12:56 PM)
- Connection time: 124 minutes
- T3: City B to City E (15:00 - 5:41 PM)

Earliest arrival: 5:41 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 2

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 12:36 PM - T2: City A to City C, Departs 08:00, Arrives 10:22 AM - T3: City B to City D, Departs 14:30, Arrives 5:19 PM - T4: City B to City C, Departs 13:00, Arrives 3:49 PM - T5: City C to City D, Departs 14:30, Arrives 4:55 PM - T6: City C to City B, Departs 14:30, Arrives 4:09 PM - T7: City E to City D, Departs 16:30, Arrives 6:58 PM - T8: City E to City B, Departs 16:30, Arrives 7:10 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (08:00 - 10:22 AM)
- Connection time: 248 minutes
- T5: City C to City D (14:30 - 4:55 PM)

Earliest arrival: 4:55 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 3

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:30, Arrives 10:17 AM - T2: City A to City C, Departs 08:00, Arrives 11:27 AM - T3: City B to City D, Departs 12:00, Arrives 2:40 PM - T4: City B to City C, Departs 16:30, Arrives 6:51 PM - T5: City C to City D, Departs 16:30, Arrives 6:32 PM - T6: City C to City B, Departs 10:30, Arrives 1:09 PM - T7: City E to City D, Departs 15:30, Arrives 6:26 PM - T8: City E to City B, Departs 10:30, Arrives 12:52 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (07:30 - 10:17 AM)
- Connection time: 103 minutes
- T3: City B to City D (12:00 - 2:40 PM)

Earliest arrival: 2:40 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 4

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 11:54 AM - T2: City A to City C, Departs 07:00, Arrives 9:27 AM - T3: City B to City E, Departs 11:30, Arrives 2:03 PM - T4: City B to City C, Departs 12:30, Arrives 2:39 PM - T5: City C to City E, Departs 12:30, Arrives 2:41 PM - T6: City C to City B, Departs 11:00, Arrives 1:19 PM - T7: City D to City E, Departs 12:30, Arrives 2:41 PM - T8: City D to City B, Departs 13:00, Arrives 2:58 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (07:00 - 9:27 AM)
- Connection time: 183 minutes
- T5: City C to City E (12:30 - 2:41 PM)

Earliest arrival: 2:41 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 5

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:30, Arrives 9:37 AM - T2: City A to City C, Departs 06:00, Arrives 9:22 AM - T3: City B to City D, Departs 11:30, Arrives 1:36 PM - T4: City B to City C, Departs 15:30, Arrives 5:09 PM - T5: City C to City D, Departs 10:00, Arrives 11:44 AM - T6: City C to City B, Departs 14:00, Arrives 4:13 PM - T7: City E to City D, Departs 11:00, Arrives 1:11 PM - T8: City E to City B, Departs 10:30, Arrives 12:28 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (07:30 - 9:37 AM)
- Connection time: 113 minutes
- T3: City B to City D (11:30 - 1:36 PM)

Earliest arrival: 1:36 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 6

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 10:09 AM - T2: City A to City C, Departs 09:00, Arrives 12:19 PM - T3: City B to City D, Departs 14:30, Arrives 4:05 PM - T4: City B to City C, Departs 11:30, Arrives 1:49 PM - T5: City C to City D, Departs 10:30, Arrives 1:03 PM - T6: City C to City B, Departs 16:00, Arrives 6:19 PM - T7: City E to City D, Departs 12:00, Arrives 1:35 PM - T8: City E to City B, Departs 16:00, Arrives 5:40 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (07:00 - 10:09 AM)
- Connection time: 261 minutes
- T3: City B to City D (14:30 - 4:05 PM)

Earliest arrival: 4:05 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 7

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 9:07 AM - T2: City A to City C, Departs 08:30, Arrives 12:20 PM - T3: City B to City D, Departs 16:30, Arrives 6:45 PM - T4: City B to City C, Departs 11:30, Arrives 2:26 PM - T5: City C to City D, Departs 14:00, Arrives 3:42 PM - T6: City C to City B, Departs 12:00, Arrives 2:38 PM - T7: City E to City D, Departs 15:00, Arrives 4:54 PM - T8: City E to City B, Departs 13:30, Arrives 3:38 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (08:30 - 12:20 PM)
- Connection time: 100 minutes
- T5: City C to City D (14:00 - 3:42 PM)

Earliest arrival: 3:42 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 8

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:30, Arrives 8:39 AM - T2: City A to City C, Departs 07:00, Arrives 10:23 AM - T3: City B to City E, Departs 14:00, Arrives 3:35 PM - T4: City B to City C, Departs 11:00, Arrives 12:30 PM - T5: City C to City E, Departs 14:30, Arrives 4:05 PM - T6: City C to City B, Departs 14:30, Arrives 5:15 PM - T7: City D to City E, Departs 10:30, Arrives 1:11 PM - T8: City D to City B, Departs 15:30, Arrives 5:19 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:30 - 8:39 AM)
- Connection time: 321 minutes
- T3: City B to City E (14:00 - 3:35 PM)

Earliest arrival: 3:35 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 9

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 9:03 AM - T2: City A to City C, Departs 06:00, Arrives 9:20 AM - T3: City B to City E, Departs 16:00, Arrives 6:06 PM - T4: City B to City C, Departs 14:30, Arrives 4:21 PM - T5: City C to City E, Departs 10:00, Arrives 12:09 PM - T6: City C to City B, Departs 11:30, Arrives 1:35 PM - T7: City D to City E, Departs 11:30, Arrives 2:11 PM - T8: City D to City B, Departs 14:00, Arrives 4:08 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:00 - 9:03 AM)
- Connection time: 417 minutes
- T3: City B to City E (16:00 - 6:06 PM)

Earliest arrival: 6:06 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 10

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 08:00, Arrives 11:40 AM - T2: City A to City C, Departs 06:30, Arrives 10:01 AM - T3: City B to City E, Departs 16:00, Arrives 6:26 PM - T4: City B to City C, Departs 15:30, Arrives 5:15 PM - T5: City C to City E, Departs 13:30, Arrives 3:48 PM - T6: City C to City B, Departs 12:00, Arrives 2:07 PM - T7: City D to City E, Departs 14:30, Arrives 5:01 PM - T8: City D to City B, Departs 13:30, Arrives 3:34 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (06:30 - 10:01 AM)
- Connection time: 209 minutes
- T5: City C to City E (13:30 - 3:48 PM)

Earliest arrival: 3:48 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 11

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 9:10 AM - T2: City A to City C, Departs 09:00, Arrives 12:19 PM - T3: City B to City E, Departs 14:00, Arrives 4:05 PM - T4: City B to City C, Departs 13:00, Arrives 2:57 PM - T5: City C to City E, Departs 15:30, Arrives 6:30 PM - T6: City C to City B, Departs 10:30, Arrives 1:05 PM - T7: City D to City E, Departs 16:30, Arrives 6:16 PM - T8: City D to City B, Departs 11:00, Arrives 1:46 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (07:00 - 9:10 AM)
- Connection time: 290 minutes
- T3: City B to City E (14:00 - 4:05 PM)

Earliest arrival: 4:05 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 12

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 06:00, Arrives 8:51 AM - T2: City A to City C, Departs 09:00, Arrives 11:25 AM - T3: City B to City D, Departs 13:00, Arrives 3:53 PM - T4: City B to City C, Departs 14:00, Arrives 4:18 PM - T5: City C to City D, Departs 16:30, Arrives 6:50 PM - T6: City C to City B, Departs 14:00, Arrives 4:10 PM - T7: City E to City D, Departs 10:00, Arrives 12:18 PM - T8: City E to City B, Departs 14:30, Arrives 4:53 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (06:00 - 8:51 AM)
- Connection time: 249 minutes
- T3: City B to City D (13:00 - 3:53 PM)

Earliest arrival: 3:53 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 13

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 07:30, Arrives 10:37 AM - T2: City A to City C, Departs 09:00, Arrives 11:15 AM - T3: City B to City E, Departs 11:00, Arrives 1:14 PM - T4: City B to City C, Departs 15:00, Arrives 4:46 PM - T5: City C to City E, Departs 11:30, Arrives 2:00 PM - T6: City C to City B, Departs 10:30, Arrives 12:38 PM - T7: City D to City E, Departs 13:30, Arrives 3:03 PM - T8: City D to City B, Departs 15:30, Arrives 5:27 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

No feasible route found with 60 min connection requirement.

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 14

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 06:30, Arrives 10:11 AM - T2: City A to City C, Departs 10:30, Arrives 12:36 PM - T3: City B to City D, Departs 10:30, Arrives 12:05 PM - T4: City B to City C, Departs 10:00, Arrives 11:38 AM - T5: City C to City D, Departs 16:00, Arrives 6:13 PM - T6: City C to City B, Departs 13:00, Arrives 2:44 PM - T7: City E to City D, Departs 13:00, Arrives 2:55 PM - T8: City E to City B, Departs 13:00, Arrives 3:18 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (10:30 - 12:36 PM)
- Connection time: 204 minutes
- T5: City C to City D (16:00 - 6:13 PM)

Earliest arrival: 6:13 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 15

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 1:14 PM - T2: City A to City C, Departs 08:00, Arrives 10:18 AM - T3: City B to City E, Departs 12:30, Arrives 3:15 PM - T4: City B to City C, Departs 13:30, Arrives 4:10 PM - T5: City C to City E, Departs 16:00, Arrives 6:16 PM - T6: City C to City B, Departs 15:00, Arrives 4:33 PM - T7: City D to City E, Departs 13:00, Arrives 3:52 PM - T8: City D to City B, Departs 13:00, Arrives 3:32 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (08:00 - 10:18 AM)
- Connection time: 342 minutes
- T5: City C to City E (16:00 - 6:16 PM)

Earliest arrival: 6:16 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 16

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 11:46 AM - T2: City A to City C, Departs 08:00, Arrives 11:03 AM - T3: City B to City E, Departs 12:00, Arrives 2:35 PM - T4: City B to City C, Departs 14:30, Arrives 4:39 PM - T5: City C to City E, Departs 16:00, Arrives 6:27 PM - T6: City C to City B, Departs 16:30, Arrives 6:09 PM - T7: City D to City E, Departs 15:30, Arrives 5:56 PM - T8: City D to City B, Departs 12:00, Arrives 2:09 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T2: City A to City C (08:00 - 11:03 AM)
- Connection time: 297 minutes
- T5: City C to City E (16:00 - 6:27 PM)

Earliest arrival: 6:27 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 17

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 10:39 AM - T2: City A to City C, Departs 07:30, Arrives 10:30 AM - T3: City B to City D, Departs 16:30, Arrives 7:18 PM - T4: City B to City C, Departs 14:30, Arrives 5:25 PM - T5: City C to City D, Departs 12:00, Arrives 1:34 PM - T6: City C to City B, Departs 15:00, Arrives 4:35 PM - T7: City E to City D, Departs 12:30, Arrives 3:01 PM - T8: City E to City B, Departs 16:00, Arrives 5:44 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T2: City A to City C (07:30 - 10:30 AM)
- Connection time: 90 minutes
- T5: City C to City D (12:00 - 1:34 PM)

Earliest arrival: 1:34 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 18

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 10:30, Arrives 1:55 PM - T2: City A to City C, Departs 08:30, Arrives 12:19 PM - T3: City B to City D, Departs 15:00, Arrives 5:33 PM - T4: City B to City C, Departs 11:30, Arrives 1:51 PM - T5: City C to City D, Departs 10:30, Arrives 1:29 PM - T6: City C to City B, Departs 15:00, Arrives 5:15 PM - T7: City E to City D, Departs 13:00, Arrives 3:43 PM - T8: City E to City B, Departs 16:30, Arrives 6:10 PM Minimum connection time is 30 minutes. What is the earliest arrival time at City D?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City D:
- City A→City B -> City B→City D
- City A→City C -> City C→City D
- City A→City B -> City B→City C -> City C→City D

2. Best route found:
- T1: City A to City B (10:30 - 1:55 PM)
- Connection time: 65 minutes
- T3: City B to City D (15:00 - 5:33 PM)

Earliest arrival: 5:33 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 19

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 06:30, Arrives 10:09 AM - T2: City A to City C, Departs 08:00, Arrives 10:52 AM - T3: City B to City E, Departs 16:00, Arrives 6:10 PM - T4: City B to City C, Departs 16:30, Arrives 6:44 PM - T5: City C to City E, Departs 11:30, Arrives 2:07 PM - T6: City C to City B, Departs 11:00, Arrives 12:41 PM - T7: City D to City E, Departs 13:30, Arrives 3:47 PM - T8: City D to City B, Departs 14:00, Arrives 4:03 PM Minimum connection time is 45 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

2. Best route found:
- T1: City A to City B (06:30 - 10:09 AM)
- Connection time: 351 minutes
- T3: City B to City E (16:00 - 6:10 PM)

Earliest arrival: 6:10 PM

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.

Question 20

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 10:00, Arrives 1:02 PM - T2: City A to City C, Departs 10:30, Arrives 2:16 PM - T3: City B to City E, Departs 11:30, Arrives 1:54 PM - T4: City B to City C, Departs 10:30, Arrives 12:50 PM - T5: City C to City E, Departs 10:00, Arrives 11:47 AM - T6: City C to City B, Departs 10:00, Arrives 12:42 PM - T7: City D to City E, Departs 14:00, Arrives 4:42 PM - T8: City D to City B, Departs 13:00, Arrives 3:10 PM Minimum connection time is 60 minutes. What is the earliest arrival time at City E?
Step-by-step solution:

Network Path Analysis:
1. Identify all possible routes from City A to City E:
- City A→City B -> City B→City E
- City A→City C -> City C→City E
- City A→City B -> City B→City C -> City C→City E

No feasible route found with 60 min connection requirement.

Key Strategy: Enumerate all possible routes, verify connection times meet minimum requirements.
Previous Worksheet Next Worksheet