Consider the following project. \[\begin{array} { | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Imunediate } \\ \text { Predecessor } \end{array} & \begin{array} { c } \text { Activity Time } \\ \text { (drys) } \end{array} \\ \hline \text { A } & - - & 3 \\ \hline \mathrm { B } & - - & 4 \\ \hline \mathrm { C } & \mathrm { A } & 4 \\ \hline \mathrm { D } & \mathrm { A } & 6 \\ \hline \mathrm { E } & \mathrm { B } & 5 \\ \hline \mathrm { F } & \mathrm { C } , \mathrm { D } & 4 \\ \hline \mathrm { G } & \mathrm { E } _ { \mathrm { F } } \mathrm { F } & 7 \\ \hline \end{array}\] -What is the latest time that activity B can finish without delaying any other activities?

A) 0 B) 8 C) 9 D) 4 A) 0 B) 8 C) 9 D) 4

Consider the following project. \[\begin{array} { | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Immediate } \\ \text { Processor } \end{array} & \begin{array} { c } \text { Activity Time } \\ \text { (days) } \end{array} \\ \hline \text { A } & - & 6 \\ \hline \text { B } & - & 8 \\ \hline \text { C } & \text { A, B } & 5 \\ \hline \text { D } & \text { B } & 4 \\ \hline \text { E } & \text { C } & 7 \\ \hline \text { F } & \text { C, D } & 3 \\ \hline \text { G } & \text { D } & 6 \\ \hline \text { H } & \text { E, F, G } & 5 \\ \hline \end{array}\] -Determine the slack for activity D.

A) 2 days B) 4 days C) 6 days D) 5 days A) 2 days B) 4 days C) 6 days D) 5 days

Exam 8: Project Management

The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. $The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. \begin{array} { | c | c | c | c | } \hline \text { Activity } & \text { Normal Time } & \text { Crash Time } & \begin{array} { c } \text { Cost per day } \\ \text { to crash } \end{array} \\ \hline \text { A } & 6 & 6 & - - - \\ \hline \text { B } & 10 & 8 & \$ 100 \\ \hline \text { C } & 5 & 4 & \$ 300 \\ \hline \text { D } & 4 & 1 & \$ 700 \\ \hline \text { E } & 9 & 7 & \$ 500 \\ \hline \text { F } & 2 & 1 & \$ 650 \\ \hline \end{array} -Determine which activities should be crashed to shorten the project by 1 day.$ Activity Normal Time Crash Time Cost per day to crash A 6 6 --- B 10 8 \ 100 C 5 4 \ 300 D 4 1 \ 700 E 9 7 \ 500 F 2 1 \ 650 -Determine which activities should be crashed to shorten the project by 1 day.

(Short Answer)

4.9/5

(92)

Question 101

The critical path is the longest path through the project network.

(True/False)

4.9/5

(75)

Question 102

A work breakdown structure breaks down a project into subcomponents, components, activities, and tasks.

(True/False)

4.9/5

(80)

Question 103

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest time that activity B can finish without delaying any other activities?

(Multiple Choice)

4.8/5

(95)

Question 104

The critical path activities have no ________.

(Short Answer)

5.0/5

(72)

Question 105

Slack is the amount of time an activity can be delayed without delaying the project.

(True/False)

4.8/5

(69)

Question 106

Given the following information for a project, what are the estimated slack times (in weeks) for activities A-H? Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5 CP = Critical Path

(Essay)

4.8/5

(78)

Question 107

Once a project is underway, the project manager is responsible for the

(Multiple Choice)

4.8/5

(79)

Question 108

Refer to the table below to answer the question(s) that follow: ~Activity~~~~~~~~~Times~ (weeks)\\ \begin{array}{c} \text { Activity } & \text { Predecessor } & \text { Optimistic } & \text { Most Likely } & \text { Pessimi } \\ \hline \text { A } & --- & 9 & 15 & 21 \\ \text { B } & --- & 13 & 21 & 23 \\ \text { C } & \text { A } & 6 & 9 & 18 \\ \text { D } & \text { A } & 23 & 35 & 47 \\ \text { E } & \text { B } & 19 & 26 & 27 \\ \text { F } & \text { C } & 23 & 29 & 41 \\ \text { G } & \text { D,E } & 14 & 20 & 26 \\ \text { H } & \text { F,G } & 2 & 5 & 8 \end{array} -What is the probability that the critical path for this project will be completed within 75 weeks?

(Short Answer)

4.9/5

(85)

Question 109

Consider the following project. Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5 -Determine the slack for activity D.

(Multiple Choice)

4.7/5

(82)

Question 110

An element of project planning is to compare the project schedule objectives.

(True/False)

4.8/5

(70)

Question 111

A statement of work is a written description of the goals, work, and time frame of a project.

(True/False)

4.7/5

(80)

Question 112

The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. $The diagram below shows the activities on the nodes, and the table shows the normal time and crash time (in days) and cost for each activity. \begin{array} { | c | c | c | c | } \hline \text { Activity } & \text { Normal Time } & \text { Crash Time } & \begin{array} { c } \text { Cost per day } \\ \text { to crash } \end{array} \\ \hline \text { A } & 6 & 6 & - - - \\ \hline \text { B } & 10 & 8 & \$ 100 \\ \hline \text { C } & 5 & 4 & \$ 300 \\ \hline \text { D } & 4 & 1 & \$ 700 \\ \hline \text { E } & 9 & 7 & \$ 500 \\ \hline \text { F } & 2 & 1 & \$ 650 \\ \hline \end{array} -Determine which activities should be crashed to shorten the project by 2 days.$ Activity Normal Time Crash Time Cost per day to crash A 6 6 --- B 10 8 \ 100 C 5 4 \ 300 D 4 1 \ 700 E 9 7 \ 500 F 2 1 \ 650 -Determine which activities should be crashed to shorten the project by 2 days.

(Short Answer)

4.9/5

(85)

Question 113

When applying linear programming models to project planning, the objective is to minimize ________.

(Short Answer)

4.9/5

(78)

Question 114

A PERT/CPM activity has an optimistic time estimate of 3 days, a most likely time estimate of 8 days, and a pessimistic time estimate of 10 days. The expected time (in days) of this activity is:

(Multiple Choice)

4.9/5

(77)

Question 115

The standard deviation of project duration is the average of the standard deviation of all activities on the critical path.

(True/False)

4.7/5

(79)

Question 116

Showing 101 - 116 of 116

The critical path is the longest path through the project network.

A work breakdown structure breaks down a project into subcomponents, components, activities, and tasks.

Consider the following project. Activity Imunediate Predecessor Activity Time (drys) A -- 3 -- 4 4 6 5 , 4 7 -What is the latest time that activity B can finish without delaying any other activities?

The critical path activities have no ________.

Slack is the amount of time an activity can be delayed without delaying the project.

Given the following information for a project, what are the estimated slack times (in weeks) for activities A-H? Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5 CP = Critical Path

Once a project is underway, the project manager is responsible for the

Consider the following project. Activity Immediate Processor Activity Time (days) A - 6 B - 8 C A, B 5 D B 4 E C 7 F C, D 3 G D 6 H E, F, G 5 -Determine the slack for activity D.

An element of project planning is to compare the project schedule objectives.

A statement of work is a written description of the goals, work, and time frame of a project.

When applying linear programming models to project planning, the objective is to minimize ________.

A PERT/CPM activity has an optimistic time estimate of 3 days, a most likely time estimate of 8 days, and a pessimistic time estimate of 10 days. The expected time (in days) of this activity is:

The standard deviation of project duration is the average of the standard deviation of all activities on the critical path.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters