1.
Which of these schedule network logic technique is an example of Precedence Diagramming Method (PDM)
2.
Discretionary Dependencies are also known as
3.
Who decides Internal and External Dependencies?
4.
Amount of time that a successor activity can be delayed with respect to its predecessor is called
5.
Logical relationship in which a successor activity cannot start until a predecessor activity has started is called
6.
In scheduling software Lead is often represented using a positive value
7.
The critical path method analysis uses which of the following techniques to create a schedule network digram?
8.
In scheduling software Lag is often represented using a negative value
9.
An activity that comes after a dependent activity in a project schedule is called?
10.
A project can have more than one critical path
11.
For activities on critical path Early Start is equal to
12.
Critical Path Method uses deterministic (single point) activity time estimates
13.
Improper use of which of the following may result in arbitrary total float.
14.
Mandatory Dependencies are also known as
15.
Critical Path Method establishes the minimum project duration
16.
Which of the following technique is most commonly used by project management software to construct the schedule network diagram?
17.
Which of these activity relationships is least commonly used in Precedence Diagramming Method
18.
A technique that calculates early start and early finish dates in the schedule network
19.
Logical relationship in which a successor activity cannot finish until a predecessor activity has finished is called
20.
Who decides Mandatory and Discretionary Dependencies?
21.
Amount of time that a successor activity can be advanced with respect to its predecessor is called
22.
Which of these activity relationships is most commonly used in Precedence Diagramming Method?
23.
Total float of activities on critical path is usually zero.
24.
Critical Path Method controls both time and cost aspect of a project
25.
A technique that calculates late start and late finish dates in the schedule network is called
26.
An activity on critical path is called
27.
Logical relationship in which a successor activity cannot start until a predecessor activity has finished is called
28.
Logical relationship in which a successor activity cannot finish until a predecessor activity has started is called
29.
The longest path in a project schedule network diagram is called
30.
An activity that comes before a dependent activity in a project schedule is called?
MilestoneTask
according to me keep It up, like it
Thanks for the appreciation
15. Discretionary Dependencies are also known as ( Please RECTIFY this anwser.
** Soft Logic
Internal Dependencies
External Dependencies
Hard Logic
Thanks for pointing it out
How do I access the questions? All I see is the header image and comments.
Hi, Thanks for pointing it out. The issue is now fixed. Both the quizzes are working.
Solving these questions made my concepts more clear
Thank You!
good exercise
Thank You!
wow excellent exercise.
Thanks
Thank you
test
Great
Thank You!
good exercise
Thank You!