Question 1

The latest finish time for an activity is the largest of the latest start times for all activities that immediately follow the activity.

Accepted Answer

A) True 
 B)False  False

Question 2

Which is not a significant challenge of project scheduling?

Accepted Answer

A) deadlines exist. 
B) activities are independent. 
C) many employees could be required. 
D) delays are costly. 
A) deadlines exist. 
B) activities are independent. 
C) many employees could be required. 
D) delays are costly. B

Question 3

The variance in the project completion time is the sum of the variances of all activities in the project.

Accepted Answer

A) True 
 B)False  False

Question 4

Which of the following is always true about a critical activity?

Accepted Answer

A) LS = EF. 
B) LF = LS. 
C) ES = LS. 
D) EF = ES. 
A) LS = EF. 
B) LF = LS. 
C) ES = LS. 
D) EF = ES.

Question 5

Which of the following is a general rule for crashing activities?

Accepted Answer

A) Crash only non-critical activities. 
B) Crash activities with zero slack. 
C) Crash activities with the greatest number of predecessors. 
D) Crash the path with the fewest activities. 
A) Crash only non-critical activities. 
B) Crash activities with zero slack. 
C) Crash activities with the greatest number of predecessors. 
D) Crash the path with the fewest activities.

Question 6

The length of time an activity can be delayed without affecting the project completion time is the slack.

Accepted Answer

A) True 
 B)False

Question 7

Explain how and why all successor activities must be considered when finding the latest finish time.

Accepted Answer

When finding the latest finish time for

Question 8

Arcs in a project network indicate

Accepted Answer

A) completion times. 
B) precedence relationships. 
C) activities. 
D) the critical path. 
A) completion times. 
B) precedence relationships. 
C) activities. 
D) the critical path.

Question 9

To determine how to crash activity times

Accepted Answer

A) normal activity costs and costs under maximum crashing must be known. 
B) shortest times with crashing must be known. 
C) realize that new paths may become critical. 
D) All of the alternatives are true. 
A) normal activity costs and costs under maximum crashing must be known. 
B) shortest times with crashing must be known. 
C) realize that new paths may become critical. 
D) All of the alternatives are true.

Question 10

Use the following network of related activities with their duration times to complete a row for each activity under the column headings below.   $$\begin{array} { | c | c | c | c | c | c | c | c | c | c } 
\hline \text { Activity } & \begin{array} { c } 
\text { Immediate } \
\text { Predecessors }
\end{array} & \begin{array} { c } 
\text { Activity } \
\text { Time }
\end{array} & E S & L S & E F & L F & \text { Sack } & \begin{array} { c } 
\text { Critical } \
\text { Path? }
\end{array} \
\hline \mathrm { A } & & & & & & & & \
\hline \mathrm { B } & & & & & & & & \
\hline \mathrm { C } & & & & & & & & \
\hline \mathrm { D } & & & & & & & & \
\hline \mathrm { E } & & & & & & & & \
\hline \mathrm { F } & & & & & & & & \
\hline \mathrm { G } & & & & & & & & \
\hline \mathrm { H } & & & & & & & & \
\hline
\end{array}$$

Accepted Answer

@#IMG-DLM& CRITICAL PATH: A-D-

Question 11

When activity times are uncertain, an activity's most likely time is the same as its expected time.

Accepted Answer

A) True 
 B)False

Question 12

The earliest finish time for the final activity is the project duration.

Accepted Answer

A) True 
 B)False

Question 13

A project network is shown below. Use a forward and a backward pass to determine the critical path, and then fill out the table below.   $$\begin{array} { | c | c | c | c | c | c | c | c | c | c } 
\hline \text { Activity } & \begin{array} { c } 
\text { Precedence } \
\text { Activities }
\end{array} & \begin{array} { c } 
\text { Activity } \
\text { Time } \
\text { (weeks) }
\end{array} & E S & L S & E F & \text { LF } & \text { Slack } & \begin{array} { c } 
\text { Critical } \
\text { Path? }
\end{array} \
\hline \mathrm { A } & & & & & & & & \
\hline \mathrm { B } & & & & & & & & \
\hline \mathrm { C } & & & & & & & & \
\hline \mathrm { D } & & & & & & & & \
\hline \mathrm { E } & & & & & & & & \
\hline \mathrm { F } & & & & & & & & \
\hline \mathrm { G } & & & & & & & & \
\hline \mathrm { H } & & & & & & & & \
\hline \mathrm { I } & & & & & & & & \
\hline
\end{array}$$ Now assume that the times listed are only the expected times instead of being fixed times. Is the probability of being finished in more than 28 weeks more or less than 50%?

Accepted Answer

@#IMG-DLM& The probability is

Question 14

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

Accepted Answer

A) largest latest-finish time among its immediate successors. 
B) smallest latest-finish time among its immediate successors. 
C) largest latest-start time among its immediate successors. 
D) smallest latest-start time among its immediate successors. 
A) largest latest-finish time among its immediate successors. 
B) smallest latest-finish time among its immediate successors. 
C) largest latest-start time among its immediate successors. 
D) smallest latest-start time among its immediate successors.

Question 15

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

Accepted Answer

A) True 
 B)False

Question 16

Name at least three managerial situations where answers are provided by project management solutions.

Accepted Answer

1. Resource allocation: Project manageme

Question 17

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

Accepted Answer

A) True 
 B)False

Question 18

PERT and CPM

Accepted Answer

A) are most valuable when a small number of activities must be scheduled. 
B) have different features and are not applied to the same situation. 
C) do not require a chronological relationship among activities. 
D) have been combined to develop a procedure that uses the best of each. 
A) are most valuable when a small number of activities must be scheduled. 
B) have different features and are not applied to the same situation. 
C) do not require a chronological relationship among activities. 
D) have been combined to develop a procedure that uses the best of each.

Question 19

Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity H

Accepted Answer

A) is 11. 
B) is 14. 
C) is 18. 
D) cannot be determined. 
A) is 11. 
B) is 14. 
C) is 18. 
D) cannot be determined.

Question 20

Use the following network of related activities with their duration times to complete a row for each activity under the column headings below.   $$\begin{array} { | c | c | c | c | c | c | c | c | c | } 
\hline \text { Activity } & \begin{array} { c } 
\text { Immediate } \
\text { Predecessors }
\end{array} & \begin{array} { c } 
\text { Time } \
\text { (weeks) }
\end{array} & E S & L S & E F & L F & \text { Sack } & \begin{array} { c } 
\text { Critical } \
\text { Path? }
\end{array} \
\hline A & \
\hline B & \
\hline \mathrm{C} & \
\hline \mathrm{D} & \
\hline \mathrm{E} & \
\hline \mathrm{F} & \
\hline \mathrm{G} & \
\hline \mathrm{H} & \
\hline \mathrm{I} & \
\hline \mathrm{J} & \
\hline
\end{array}$$

Accepted Answer

@#IMG-DLM& CRITICAL PATH: A-D-

The latest finish time for an activity is the largest of the latest start times for all activities that immediately follow the activity.

Which is not a significant challenge of project scheduling?

The variance in the project completion time is the sum of the variances of all activities in the project.

Which of the following is always true about a critical activity?

Which of the following is a general rule for crashing activities?

The length of time an activity can be delayed without affecting the project completion time is the slack.

Explain how and why all successor activities must be considered when finding the latest finish time.

Arcs in a project network indicate

To determine how to crash activity times

When activity times are uncertain, an activity's most likely time is the same as its expected time.

The earliest finish time for the final activity is the project duration.

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

Name at least three managerial situations where answers are provided by project management solutions.

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

PERT and CPM

Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity H

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 9: Project Scheduling: Pertcpm

The latest finish time for an activity is the largest of the latest start times for all activities that immediately follow the activity.

Which is not a significant challenge of project scheduling?

The variance in the project completion time is the sum of the variances of all activities in the project.

Which of the following is always true about a critical activity?

Which of the following is a general rule for crashing activities?

The length of time an activity can be delayed without affecting the project completion time is the slack.

Explain how and why all successor activities must be considered when finding the latest finish time.

Arcs in a project network indicate

To determine how to crash activity times

Use the following network of related activities with their duration times to complete a row for each activity under the column headings below. Activity Immediate Predecessors Activity Time ES LS EF LF Sack Critical Path?

When activity times are uncertain, an activity's most likely time is the same as its expected time.

The earliest finish time for the final activity is the project duration.

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

Name at least three managerial situations where answers are provided by project management solutions.

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

PERT and CPM

Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity H

Use the following network of related activities with their duration times to complete a row for each activity under the column headings below. Activity Immediate Predecessors Time (weeks) ES LS EF LF Sack Critical Path? A B

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters