Search topics

Search
1 of 8 0-day streak

Translate between precedence data and an activity network

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
tableToNetwork; none; chaintableToNetwork; none; chain; prefixtableToNetwork; none; chain; tailtableToNetwork; none; chain; prefix; tailtableToNetwork; none; full merge; prefixtableToNetwork; none; full merge; tailtableToNetwork; none; full merge; prefix; tailtableToNetwork; none; merge tailtableToNetwork; none; merge tail; prefixtableToNetwork; none; merge tail; tailtableToNetwork; none; merge tail; prefix; tailtableToNetwork; none; two chains mergetableToNetwork; none; two chains merge; prefixtableToNetwork; none; two chains merge; tailtableToNetwork; none; two chains merge; prefix; tailtableToNetwork; none; split tailstableToNetwork; none; split tails; prefixtableToNetwork; none; split tails; tailtableToNetwork; none; split tails; prefix; tailtableToNetwork; none; diamond chaintableToNetwork; none; diamond chain; prefixtableToNetwork; none; diamond chain; tailtableToNetwork; none; diamond chain; prefix; tailtableToNetwork; none; three to two; prefixtableToNetwork; none; three to two; tailtableToNetwork; none; three to two; prefix; tailtableToNetwork; none; nested mergetableToNetwork; none; nested merge; prefixtableToNetwork; none; nested merge; tailtableToNetwork; none; nested merge; prefix; tailnetworkToTable; none; chainnetworkToTable; none; chain; prefixnetworkToTable; none; chain; tailnetworkToTable; none; chain; prefix; tailnetworkToTable; none; full merge; prefixnetworkToTable; none; full merge; tailnetworkToTable; none; full merge; prefix; tailnetworkToTable; none; merge tailnetworkToTable; none; merge tail; prefixnetworkToTable; none; merge tail; tailnetworkToTable; none; merge tail; prefix; tailnetworkToTable; none; two chains mergenetworkToTable; none; two chains merge; prefixnetworkToTable; none; two chains merge; tailnetworkToTable; none; two chains merge; prefix; tailnetworkToTable; none; split tailsnetworkToTable; none; split tails; prefixnetworkToTable; none; split tails; tailnetworkToTable; none; split tails; prefix; tailnetworkToTable; none; diamond chainnetworkToTable; none; diamond chain; prefixnetworkToTable; none; diamond chain; tailnetworkToTable; none; diamond chain; prefix; tailnetworkToTable; none; three to two; prefixnetworkToTable; none; three to two; tailnetworkToTable; none; three to two; prefix; tailnetworkToTable; none; nested mergenetworkToTable; none; nested merge; prefixnetworkToTable; none; nested merge; tailnetworkToTable; none; nested merge; prefix; tailNOWMix of allRecommended
Question 1 of 8

No calculator

Consider the activity-on-arrow data for a workshop refit. Nodes are events. Solid arrows are activities and dashed arrows are zero-duration dummy activities. The precedence relation records which activities must finish before another activity starts

Given immediate-predecessor data
ActivityImmediate predecessors
DC
Cnone
GF
FC
ED
Activity labels used in network options
ActivityDuration (days)
D3
C4
G2
F2
E5
(a)1 mark

Select the network that preserves all immediate-predecessor data

(b)1 mark

How many activities have no immediate predecessors?

(c)1 mark

Select the direct predecessor set for activity G