A project schedule table lists tasks, their durations, and dependencies. Task A (3 days) has no dependencies. Task B (5 days) depends on Task A. Task C (4 days) depends on Task A. Task D (6 days) depends on both Task B and Task C. Task E (2 days) depends on Task D. What is the minimum number of days to complete the entire project?

The correct answer to the question "A project schedule table lists tasks, their durations, and dependencies. Task A (3 days) has no dependencies. Task B (5 days) depends on Task A. Task C (4 days) depends on Task A. Task D (6 days) depends on both Task B and Task C. Task E (2 days) depends on Task D. What is the minimum number of days to complete the entire project?" is Option C: 14 days.

The other options — A) 12 days, B) 13 days, D) 15 days — are incorrect for this GMAT Exam Prep question. As explained above: Path 1: A -> B -> D -> E = 3 + 5 + 6 + 2 = 16 days. Path 2: A -> C -> D -> E = 3 + 4 + 6 + 2 = 15 days. The critical path is the longest sequence, so 16 days.