Question
Consider the following table of activities A through G in which A is the start node and G is the stop node. Activity Duration (days)
Consider the following table of activities A through G in which A is the start node and G is the stop node.
| Activity | Duration (days) | Predecessor |
| A | 10 | -- |
| B | 20 | A |
| C | 5 | A |
| D | 3 | B, C |
| E | 20 | B, C |
| F | 4 | B, C |
| G | 10 | D, E, F |
On a piece of scratch paper, draw the network associated with this table and determine the following. Considering the lengths of all the paths, this project is _____ with maximum slack associated with any one activity of ____ days.
Multiple Choice
Insensitive, 17
Sensitive, 15
Insensitive, 15
Sensitive, 2
Insensitive, 2
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Microeconomics An Intuitive Approach with Calculus
Authors: Thomas Nechyba
1st edition
538453257, 978-0538453257
