ReasoningAbility.com

Transportation Schedule: Worksheet 2 - Beginner Practice Transportation Schedule BEGINNER

Ready to master Transportation Schedule? This entry level practice worksheet (2/10) presents 20 beginner-level challenges. Focus area: pattern recognition. Learn to solve transportation schedule reasoning questions, handle transportation schedule practice, and perfect transportation schedule for competitive exams with our step-by-step solutions.

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

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

Question 1

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:30, Arrives 12:45 PM - T2: City A to City C, Departs 08:30, Arrives 10:47 AM - T3: City B to City D, Departs 11:30, Arrives 1:15 PM - T4: City B to City C, Departs 12:00, Arrives 2:25 PM - T5: City C to City D, Departs 14:00, Arrives 4:54 PM - T6: City C to City B, Departs 11:30, Arrives 1:10 PM - T7: City E to City D, Departs 11:30, Arrives 1:01 PM - T8: City E to City B, Departs 12:00, Arrives 2:02 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 - 10:47 AM)
- Connection time: 193 minutes
- T5: City C to City D (14:00 - 4:54 PM)

Earliest arrival: 4:54 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 08:00, Arrives 10:17 AM - T2: City A to City C, Departs 08:30, Arrives 11:46 AM - T3: City B to City D, Departs 13:30, Arrives 3:26 PM - T4: City B to City C, Departs 11:00, Arrives 1:11 PM - T5: City C to City D, Departs 12:30, Arrives 2:33 PM - T6: City C to City B, Departs 11:30, Arrives 1:37 PM - T7: City E to City D, Departs 11:00, Arrives 1:56 PM - T8: City E to City B, Departs 14:00, Arrives 4:05 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:30 - 11:46 AM)
- Connection time: 44 minutes
- T5: City C to City D (12:30 - 2:33 PM)

Earliest arrival: 2:33 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 E. The transport schedule is: - T1: City A to City B, Departs 08:00, Arrives 10:28 AM - T2: City A to City C, Departs 09:30, Arrives 1:30 PM - T3: City B to City E, Departs 16:30, Arrives 7:29 PM - T4: City B to City C, Departs 15:00, Arrives 5:42 PM - T5: City C to City E, Departs 14:30, Arrives 4:48 PM - T6: City C to City B, Departs 15:30, Arrives 6:10 PM - T7: City D to City E, Departs 16:00, Arrives 6:04 PM - T8: City D to City B, Departs 13:00, Arrives 3:24 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 (09:30 - 1:30 PM)
- Connection time: 60 minutes
- T5: City C to City E (14:30 - 4:48 PM)

Earliest arrival: 4:48 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 D. The transport schedule is: - T1: City A to City B, Departs 10:30, Arrives 2:10 PM - T2: City A to City C, Departs 08:30, Arrives 11:44 AM - T3: City B to City D, Departs 13:30, Arrives 3:07 PM - T4: City B to City C, Departs 14:30, Arrives 4:47 PM - T5: City C to City D, Departs 16:00, Arrives 6:49 PM - T6: City C to City B, Departs 10:00, Arrives 12:35 PM - T7: City E to City D, Departs 16:30, Arrives 7:13 PM - T8: City E to City B, Departs 10:30, Arrives 12:58 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 - 11:44 AM)
- Connection time: 256 minutes
- T5: City C to City D (16:00 - 6:49 PM)

Earliest arrival: 6:49 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 08:30, Arrives 12:06 PM - T2: City A to City C, Departs 09:30, Arrives 12:53 PM - T3: City B to City D, Departs 13:30, Arrives 4:03 PM - T4: City B to City C, Departs 15:30, Arrives 5:58 PM - T5: City C to City D, Departs 12:30, Arrives 2:45 PM - T6: City C to City B, Departs 13:00, Arrives 3:50 PM - T7: City E to City D, Departs 12:30, Arrives 2:24 PM - T8: City E to City B, Departs 14:30, Arrives 5:20 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 (08:30 - 12:06 PM)
- Connection time: 84 minutes
- T3: City B to City D (13:30 - 4:03 PM)

Earliest arrival: 4:03 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 9:06 AM - T2: City A to City C, Departs 06:30, Arrives 10:01 AM - T3: City B to City D, Departs 10:00, Arrives 12:27 PM - T4: City B to City C, Departs 16:30, Arrives 6:14 PM - T5: City C to City D, Departs 13:30, Arrives 3:34 PM - T6: City C to City B, Departs 13:00, Arrives 3:22 PM - T7: City E to City D, Departs 11:00, Arrives 1:51 PM - T8: City E to City B, Departs 15:00, Arrives 4:38 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 (07:00 - 9:06 AM)
- Connection time: 54 minutes
- T3: City B to City D (10:00 - 12:27 PM)

Earliest arrival: 12:27 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 06:30, Arrives 10:02 AM - T2: City A to City C, Departs 10:30, Arrives 2:29 PM - T3: City B to City D, Departs 12:30, Arrives 3:21 PM - T4: City B to City C, Departs 11:00, Arrives 1:49 PM - T5: City C to City D, Departs 15:00, Arrives 5:43 PM - T6: City C to City B, Departs 13:30, Arrives 3:48 PM - T7: City E to City D, Departs 14:00, Arrives 3:37 PM - T8: City E to City B, Departs 10:30, Arrives 12:10 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 (06:30 - 10:02 AM)
- Connection time: 148 minutes
- T3: City B to City D (12:30 - 3:21 PM)

Earliest arrival: 3:21 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 D. The transport schedule is: - T1: City A to City B, Departs 07:30, Arrives 10:04 AM - T2: City A to City C, Departs 06:00, Arrives 8:10 AM - T3: City B to City D, Departs 15:00, Arrives 5:49 PM - T4: City B to City C, Departs 13:00, Arrives 2:35 PM - T5: City C to City D, Departs 10:00, Arrives 11:33 AM - T6: City C to City B, Departs 10:00, Arrives 12:31 PM - T7: City E to City D, Departs 12:00, Arrives 2:06 PM - T8: City E to City B, Departs 16:00, Arrives 6:32 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 (06:00 - 8:10 AM)
- Connection time: 110 minutes
- T5: City C to City D (10:00 - 11:33 AM)

Earliest arrival: 11:33 AM

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

Question 9

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 1:44 PM - T2: City A to City C, Departs 07:30, Arrives 11:19 AM - T3: City B to City D, Departs 11:30, Arrives 1:34 PM - T4: City B to City C, Departs 11:00, Arrives 1:55 PM - T5: City C to City D, Departs 16:30, Arrives 7:24 PM - T6: City C to City B, Departs 10:30, Arrives 1:27 PM - T7: City E to City D, Departs 12:30, Arrives 2:29 PM - T8: City E to City B, Departs 11:00, Arrives 1:05 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 - 11:19 AM)
- Connection time: 311 minutes
- T5: City C to City D (16:30 - 7:24 PM)

Earliest arrival: 7:24 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 D. The transport schedule is: - T1: City A to City B, Departs 09:00, Arrives 11:18 AM - T2: City A to City C, Departs 09:30, Arrives 1:05 PM - T3: City B to City D, Departs 12:00, Arrives 1:54 PM - T4: City B to City C, Departs 12:00, Arrives 1:36 PM - T5: City C to City D, Departs 13:00, Arrives 3:08 PM - T6: City C to City B, Departs 14:30, Arrives 5:05 PM - T7: City E to City D, Departs 16:00, Arrives 6:11 PM - T8: City E to City B, Departs 11:00, Arrives 1:51 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

No feasible route found with 45 min connection requirement.

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

Question 11

A traveler needs to go from City A to City D. The transport schedule is: - T1: City A to City B, Departs 09:30, Arrives 1:01 PM - T2: City A to City C, Departs 09:30, Arrives 12:15 PM - T3: City B to City D, Departs 13:00, Arrives 3:52 PM - T4: City B to City C, Departs 11:00, Arrives 1:05 PM - T5: City C to City D, Departs 16:30, Arrives 6:45 PM - T6: City C to City B, Departs 16:30, Arrives 6:30 PM - T7: City E to City D, Departs 14:00, Arrives 4:47 PM - T8: City E to City B, Departs 13:00, Arrives 2:41 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 (09:30 - 12:15 PM)
- Connection time: 255 minutes
- T5: City C to City D (16:30 - 6:45 PM)

Earliest arrival: 6:45 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 09:30, Arrives 12:25 PM - T2: City A to City C, Departs 09:30, Arrives 1:14 PM - T3: City B to City D, Departs 16:30, Arrives 7:15 PM - T4: City B to City C, Departs 14:00, Arrives 4:12 PM - T5: City C to City D, Departs 16:00, Arrives 6:46 PM - T6: City C to City B, Departs 16:00, Arrives 6:39 PM - T7: City E to City D, Departs 12:00, Arrives 2:00 PM - T8: City E to City B, Departs 10:00, Arrives 12:26 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 (09:30 - 1:14 PM)
- Connection time: 166 minutes
- T5: City C to City D (16:00 - 6:46 PM)

Earliest arrival: 6:46 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 08:00, Arrives 10:53 AM - T2: City A to City C, Departs 07:00, Arrives 10:12 AM - T3: City B to City E, Departs 14:00, Arrives 4:09 PM - T4: City B to City C, Departs 16:30, Arrives 6:42 PM - T5: City C to City E, Departs 12:00, Arrives 1:38 PM - T6: City C to City B, Departs 16:30, Arrives 6:01 PM - T7: City D to City E, Departs 14:30, Arrives 5:23 PM - T8: City D to City B, Departs 12:00, Arrives 2:54 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 (07:00 - 10:12 AM)
- Connection time: 108 minutes
- T5: City C to City E (12:00 - 1:38 PM)

Earliest arrival: 1:38 PM

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

Question 14

A traveler needs to go from City A to City E. The transport schedule is: - T1: City A to City B, Departs 08:30, Arrives 10:33 AM - T2: City A to City C, Departs 09:30, Arrives 12:43 PM - T3: City B to City E, Departs 15:30, Arrives 5:03 PM - T4: City B to City C, Departs 12:30, Arrives 2:53 PM - T5: City C to City E, Departs 11:00, Arrives 1:54 PM - T6: City C to City B, Departs 14:30, Arrives 4:14 PM - T7: City D to City E, Departs 15:30, Arrives 5:10 PM - T8: City D to City B, Departs 11:30, Arrives 1:14 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 (08:30 - 10:33 AM)
- Connection time: 297 minutes
- T3: City B to City E (15:30 - 5:03 PM)

Earliest arrival: 5:03 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 06:30, Arrives 9:52 AM - T2: City A to City C, Departs 06:00, Arrives 9:01 AM - T3: City B to City E, Departs 16:00, Arrives 6:40 PM - T4: City B to City C, Departs 12:30, Arrives 2:44 PM - T5: City C to City E, Departs 16:30, Arrives 6:04 PM - T6: City C to City B, Departs 15:00, Arrives 5:29 PM - T7: City D to City E, Departs 10:00, Arrives 12:12 PM - T8: City D to City B, Departs 16:30, Arrives 7:24 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:00 - 9:01 AM)
- Connection time: 449 minutes
- T5: City C to City E (16:30 - 6:04 PM)

Earliest arrival: 6:04 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 D. The transport schedule is: - T1: City A to City B, Departs 07:00, Arrives 10:46 AM - T2: City A to City C, Departs 07:30, Arrives 10:51 AM - T3: City B to City D, Departs 12:00, Arrives 2:56 PM - T4: City B to City C, Departs 16:00, Arrives 6:28 PM - T5: City C to City D, Departs 10:30, Arrives 1:30 PM - T6: City C to City B, Departs 16:30, Arrives 6:11 PM - T7: City E to City D, Departs 15:00, Arrives 5:58 PM - T8: City E to City B, Departs 15:00, Arrives 5:59 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:46 AM)
- Connection time: 74 minutes
- T3: City B to City D (12:00 - 2:56 PM)

Earliest arrival: 2:56 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 09:30, Arrives 1:05 PM - T2: City A to City C, Departs 10:00, Arrives 12:06 PM - T3: City B to City D, Departs 11:30, Arrives 1:10 PM - T4: City B to City C, Departs 13:30, Arrives 3:49 PM - T5: City C to City D, Departs 11:00, Arrives 12:37 PM - T6: City C to City B, Departs 10:00, Arrives 12:50 PM - T7: City E to City D, Departs 11:30, Arrives 1:41 PM - T8: City E to City B, Departs 14:00, Arrives 4:44 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

No feasible route found with 30 min connection requirement.

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:31 PM - T2: City A to City C, Departs 08:00, Arrives 10:39 AM - T3: City B to City D, Departs 14:00, Arrives 3:35 PM - T4: City B to City C, Departs 12:30, Arrives 3:20 PM - T5: City C to City D, Departs 11:00, Arrives 1:13 PM - T6: City C to City B, Departs 16:30, Arrives 6:27 PM - T7: City E to City D, Departs 15:00, Arrives 5:01 PM - T8: City E to City B, Departs 14:30, Arrives 4:30 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

No feasible route found with 60 min connection requirement.

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 10:00, Arrives 12:58 PM - T2: City A to City C, Departs 06:30, Arrives 9:07 AM - T3: City B to City E, Departs 13:30, Arrives 4:21 PM - T4: City B to City C, Departs 13:30, Arrives 3:49 PM - T5: City C to City E, Departs 11:00, Arrives 1:57 PM - T6: City C to City B, Departs 10:00, Arrives 12:02 PM - T7: City D to City E, Departs 13:30, Arrives 3:53 PM - T8: City D to City B, Departs 14:30, Arrives 4:08 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

2. Best route found:
- T2: City A to City C (06:30 - 9:07 AM)
- Connection time: 113 minutes
- T5: City C to City E (11:00 - 1:57 PM)

Earliest arrival: 1:57 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 09:30, Arrives 11:59 AM - T2: City A to City C, Departs 07:00, Arrives 9:26 AM - T3: City B to City E, Departs 10:00, Arrives 12:05 PM - T4: City B to City C, Departs 12:30, Arrives 2:15 PM - T5: City C to City E, Departs 12:30, Arrives 2:00 PM - T6: City C to City B, Departs 15:30, Arrives 5:19 PM - T7: City D to City E, Departs 14:30, Arrives 4:30 PM - T8: City D to City B, Departs 14:30, Arrives 4:06 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

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

Earliest arrival: 2:00 PM

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