Question 1

Slack represents the amount of time by which an activity can be delayed without delaying the entire project,assuming that

Accepted Answer

A) all successor activities start at their earliest start times. 
B) all predecessor activities start at their earliest start times. 
C) immediate predecessor activities start at their earliest start times. 
D) all predecessor activities start at their latest start times. 
A) all successor activities start at their earliest start times. 
B) all predecessor activities start at their earliest start times. 
C) immediate predecessor activities start at their earliest start times. 
D) all predecessor activities start at their latest start times.

Question 2

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.The following spreadsheet was developed to determine the earliest start times and latest start times for the project.Based on the data in the spreadsheet,which activities are on the critical path?
 $\begin{array}{|r|r|r|r|r|r|r|r|r|r|}\hline&A&B&C&D&E&F&G&H&I\
\hline 1 & \text { Activity } & \text { Description } & \text { Predecessor } & \text { Time } & \text { EST } & \text { EFT } & \text { LST } & \text { LFT } &\text { Slack } \
\hline 2 & \text { A } & \text { Activity A } & & 1 & 0 & 1 & 0 & 1 &0\\hline 3 & \text { B } & \text { Activity B } & \text { A } & 4 & 1 & 5 & 1 & 5 &0 \
\hline 4 & \text { C } & \text { Activity C } & \text { B } & 3 & 5 & 8 & 5 & 8 &0\
\hline 5 & \text { D } & \text { Activity D } & \text { C } & 3 & 8 & 11 & 8 & 11 &0 \\hline 6 & \text { E } & \text { Activity } \mathrm{E} & \mathrm{B} & 2 & 5 & 7 & 5 & 7 &0\
\hline 7 & \mathrm{~F} & \text { Activity F } & \mathrm{E} & 4 & 7 & 11 & 7 & 11 &0 \\hline 8 & \text { G } & \text { Activity G } & \text { D, F } & 2 & 11 & 13 & 11 & 13&0 \
\hline
\end{array}$

Accepted Answer

All activities are on the crit

Question 3

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

Accepted Answer

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

Question 4

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 H5 to calculate the Latest Finish Time?

Accepted Answer

A) E2 + D2 
B) MAXIFISNUMBERFIND$A$2:$A$8,C5)),$F$2:$F$8)) 
C) H2 ? D2 
D) MINIFISERRFINDA5,$C$5:$C$17)),MAX$F$5:$F$17),$G$5:$G$17)) 
A) E2 + D2 
B) MAXIFISNUMBERFIND$A$2:$A$8,C5)),$F$2:$F$8)) 
C) H2 ? D2 
D) MINIFISERRFINDA5,$C$5:$C$17)),MAX$F$5:$F$17),$G$5:$G$17))

Question 5

Which of the following correctly describes the focus of the Critical Path Method CPM)?

Accepted Answer

A) To order activities in a project in terms of their completion time to facilitate scheduling of the activities. 
B) To determine when a project should be completed and to schedule when each activity in the project must begin in order to keep the project on schedule. 
C) To estimate the probability of completing a project by a given deadline when the time required to perform the activity is essentially a random variable. 
D) To structure the activities of a project in order to eliminate or reduce critical dependencies among the activities. 
A) To order activities in a project in terms of their completion time to facilitate scheduling of the activities. 
B) To determine when a project should be completed and to schedule when each activity in the project must begin in order to keep the project on schedule. 
C) To estimate the probability of completing a project by a given deadline when the time required to perform the activity is essentially a random variable. 
D) To structure the activities of a project in order to eliminate or reduce critical dependencies among the activities.

Slack represents the amount of time by which an activity can be delayed without delaying the entire project,assuming that

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

Which of the following correctly describes the focus of the Critical Path Method CPM)?

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

Slack represents the amount of time by which an activity can be delayed without delaying the entire project,assuming that

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

Which of the following correctly describes the focus of the Critical Path Method CPM)?

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