Question 1

An activity

Accepted Answer

A) is an effort required to complete part of the project 
B) is a milestone 
C) consumes no resources 
D) describes precedence relationship 
A) is an effort required to complete part of the project 
B) is a milestone 
C) consumes no resources 
D) describes precedence relationship

Question 2

Shortening the activity completion time is called

Accepted Answer

A) expediting 
B) speeding 
C) accelerating 
D) crashing 
A) expediting 
B) speeding 
C) accelerating 
D) crashing

Question 3

Non-critical activities are distinguished by the presence of

Accepted Answer

A) positive slack. 
B) idle resources. 
C) wasted time. 
D) zero slack. 
A) positive slack. 
B) idle resources. 
C) wasted time. 
D) zero slack.

Question 4

Exhibit 15.4
The following questions are based on the information below.
A company needs to manage a project which consists of the following set of activities:
Activity
Days Required
Predecessor Activities
A 1 −
B 4 A
C 3 B
D 3 C
E 2 B
F 4 E
G 2 D,F
-Refer to Exhibit 15.4.Manually determine the earliest and latest start and finish times for each activity and the amount of slack for each activity.What is the critical path for the project and how long should it take to complete it?

Accepted Answer

@#IMG-DLM& Critical

Question 5

A strength of Gantt charts is that they

Accepted Answer

A) clearly portray precedence relationships. 
B) model uncertainty in activity duration times. 
C) provide a timeline-based,graphical view of when activities can begin and end. 
D) clearly identifies the critical path. 
A) clearly portray precedence relationships. 
B) model uncertainty in activity duration times. 
C) provide a timeline-based,graphical view of when activities can begin and end. 
D) clearly identifies the critical path.

Question 6

Exhibit 15.3
The following questions are based on the information below.
A company needs to manage a project which consists of the following set of activities:
 $\begin{array}{clc}& \text { Days } & \text { Predecessor } \
\text { Activity } & \text { Required } & \text { Activities }\
\hline\text { A } & 5 & - \
\text { B } & 3 & \text { A } \
\text { C } & 4 & \text { A } \
\text { D } & 7 & \text { B, C } \
\text { E } & 6 & \text { C } \
\text { F } & 5 & \text { E } \
\text { G } & 4 & \text { D, F }
\end{array}$
-Refer to Exhibit 15.3.Identify each path through the network and its expected length.

Accepted Answer

A-B-D-G = 19 DAYS
A-

Question 7

Exhibit 15.5
The following questions use the information below.
A company wants to crash a project and reduce the time required to complete it.They have developed the following table of activity costs and times and a spreadsheet to compute starting time for each activity.
 $\begin{array}{|c|c|c|c|c|c|c|c|c|} 
\hline& \text { A } & \text { B } & \text { C } & \text { D } & \text { E } & \text { F } & \text { G } & \text { H } \
\hline 1 & & & \text { Normal } & & \text { Crash } & & \text { Allowable } & \text { Crash Cost } \
\hline 2 & \text { Activity } & \text { Description } & \text { Time } & \text { Cost } & \text { Time } & \text { Cost } & \text { Crash Days } & \text { Per Day } \\hline 3 & \mathrm{~A} & - & 5 & 6000 & 3 & 8000 & 2 & 1000 \
\hline 4 & \mathrm{~B} & - & 3 & 18000 & 2 & 19000 & 1 & 1000 \
\hline 5 & \mathrm{C} & - & 4 & 14000 & 2 & 19000 & 2 & 2500 \\hline 6 & \text { D } & - & 7 & 6000 & 4 & 9000 & 3 & 1000 \
\hline 7 & \text { E } & - & 6 & 9000 & 1 & 14000 & 5 & 1000 \
\hline 8 & \text { F } & - & 5 & 12000 & 3 & 14000 & 2 & 1000 \
\hline 9 & \text { G } & - & 4 & 3500 & 2 & 7500 & 2 & 2000 \
\hline&\text { Costs }\
\hline
\end{array}$  
-Refer to Exhibit 15.5.If the following project must be completed by day 18 at minimum cost how do we change the LP model?

Accepted Answer

Add a cons

Question 8

Exhibit 15.1
The following questions employ the AON network and partial spreadsheet below.
   $$\begin{array} { | c | c | c | c | c | c | c | c | c | c | } 
\hline & \text { A } & \text { B } & \text { C } & \text { D } & \text { E } & \text { F } & \text { G } & \text { H } & \text { I } \
\hline 1 & \text { Activity } & \text { Description } & \text { Predecessar } & \text { Time } & \text { EST } & \text { EFT } & \text { LST } & \text { LFT } & \text { Slack } \
\hline 2 & \text { A } & \text { Activity A } & & 4 & \text { I } & 4 & \text { I } & 4 & \
\hline 3 & \text { B } & \text { Activity B } & \text { A } & 3 & 4 & 7 & 4 & 7 & \
\hline 4 & \text { C } & \text { Activity C } & \text { A } & 2 & 4 & 6 & 5 & 7 & \
\hline 5 & \text { D } & \text { Activity D } & ? & 7 & ? & ? & ? & ? & \
\hline \text { 6 } & \text { E } & \text { Activity E } & \text { D } & 1 & 14 & 15 & 15 & 16 & \
\hline 7 & \text { F } & \text { Activity F } & \text { D } & 2 & 14 & 16 & 14 & 16 & \
\hline8 & \text { G } & \text { Activity G } & \text { E ,F } & 3 & 16 & 19 & 16 & 19 & \
\hline
\end{array}$$
-Refer to Exhibit 15.1.What array formula is placed in cell E5 to calculate the Earliest Start Time?

Accepted Answer

A) E2 + D2 
B) MAXIFISERRFIND$A$5:$A$17,C5)),0,$F$5:$F$17)) 
C) H2 ? D2 
D) MINIFISNUMBERFINDA5,$C$2:$C$8)),$G$2:$G$8)) 
A) E2 + D2 
B) MAXIFISERRFIND$A$5:$A$17,C5)),0,$F$5:$F$17)) 
C) H2 ? D2 
D) MINIFISNUMBERFINDA5,$C$2:$C$8)),$G$2:$G$8))

Question 9

How many paths are there in the following project precedence network?

Accepted Answer

A) 6 
B) 7 
C) 8 
D) 9 
A) 6 
B) 7 
C) 8 
D) 9

Question 10

A way to crash an activity is to

Accepted Answer

A) spend extra money 
B) subcontract 
C) use overtime 
D) all of the above 
A) spend extra money 
B) subcontract 
C) use overtime 
D) all of the above

Question 11

Exhibit 15.6
The following questions use the information below.
Consider the CPM network for the following set off activities: Activity Predecessor Activities
   A ---
B A
C A,B
D A,B
E A,B,C
F A,B,C
G A,B,C,D
H A,B,D
I A,B,C,D,F,G
-Refer to Exhibit 15.6.Is it necessary to draw an arc from the node for activity A to the node for activity C?

Accepted Answer

No,B is the only imm

Question 12

Activities with zero slack

Accepted Answer

A) are dummy activities 
B) lie on the critical path 
C) must be completed first 
D) must be delayed 
A) are dummy activities 
B) lie on the critical path 
C) must be completed first 
D) must be delayed

Question 13

Slack for activity I is computed as

Accepted Answer

A) LFTi − ESTi 
B) LSTi − ESTi 
C) ESTi − LSTi 
D) EFTi − LFTi 
A) LFTi − ESTi 
B) LSTi − ESTi 
C) ESTi − LSTi 
D) EFTi − LFTi

Question 14

What are the immediate successors of activity D in this network?

Accepted Answer

A) A,B,C 
B) B,C 
C) E,F 
D) E 
A) A,B,C 
B) B,C 
C) E,F 
D) E

Question 15

Critical activities are distinguished by the presence of

Accepted Answer

A) slack. 
B) idle resources. 
C) wasted time. 
D) zero slack. 
A) slack. 
B) idle resources. 
C) wasted time. 
D) zero slack.

Question 16

Exhibit 15.4
The following questions are based on the information below.
A company needs to manage a project which consists of the following set of activities:
Activity
Days Required
Predecessor Activities
A 1 −
B 4 A
C 3 B
D 3 C
E 2 B
F 4 E
G 2 D,F
-Refer to Exhibit 15.4.Identify each path through the network and its expected length.

Accepted Answer

A-B-C-D-G

Question 17

Exhibit 15.3
The following questions are based on the information below.
A company needs to manage a project which consists of the following set of activities:
 $\begin{array}{clc}& \text { Days } & \text { Predecessor } \
\text { Activity } & \text { Required } & \text { Activities }\
\hline\text { A } & 5 & - \
\text { B } & 3 & \text { A } \
\text { C } & 4 & \text { A } \
\text { D } & 7 & \text { B, C } \
\text { E } & 6 & \text { C } \
\text { F } & 5 & \text { E } \
\text { G } & 4 & \text { D, F }
\end{array}$
-Refer to Exhibit 15.3.Draw the CPM network for this problem.Use AON notation.

Accepted Answer

The answer of Exhibit 15.3
The following questions are based on...

Question 18

Which of the following is true regarding projects?

Accepted Answer

A) Projects can have a unique start activity and a unique finish activity. 
B) Projects can have multiple start activities and a unique finish activity. 
C) Projects can have multiple start and finish activities. 
D) All of these are true regarding projects. 
A) Projects can have a unique start activity and a unique finish activity. 
B) Projects can have multiple start activities and a unique finish activity. 
C) Projects can have multiple start and finish activities. 
D) All of these are true regarding projects.

Question 19

The critical path is the path throughout the network.

Accepted Answer

A) longest 
B) most expensive 
C) shortest 
D) least expensive 
A) longest 
B) most expensive 
C) shortest 
D) least expensive

Question 20

Exhibit 15.4
The following questions are based on the information below.
A company needs to manage a project which consists of the following set of activities:
Activity
Days Required
Predecessor Activities
A 1 −
B 4 A
C 3 B
D 3 C
E 2 B
F 4 E
G 2 D,F
-Refer to Exhibit 15.4.Draw the CPM network for this problem.Use AON notation.

Accepted Answer

The answer of Exhibit 15.4
The following questions are based on...

An activity

Shortening the activity completion time is called

Non-critical activities are distinguished by the presence of

A strength of Gantt charts is that they

How many paths are there in the following project precedence network?

A way to crash an activity is to

Activities with zero slack

Slack for activity I is computed as

What are the immediate successors of activity D in this network?

Critical activities are distinguished by the presence of

Which of the following is true regarding projects?

The critical path is the path throughout the network.

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming and Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Filters

Exam 15: Project Management Online

An activity

Shortening the activity completion time is called

Non-critical activities are distinguished by the presence of

A strength of Gantt charts is that they

How many paths are there in the following project precedence network?

A way to crash an activity is to

Activities with zero slack

Slack for activity I is computed as

What are the immediate successors of activity D in this network?

Critical activities are distinguished by the presence of

Which of the following is true regarding projects?

The critical path is the path throughout the network.

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming and Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Filters