Search

1 of 8 0-day streak

Translate between precedence data and an activity network

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

An activity-on-arrow model for community event preparation is given below. 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

Activity-on-arrow network. Nodes are events. Event order: [e16 | e17 | e18 | e19 | e20 | e21]. Full activity list: E: e18 to e19, 3 days, solid; G: e19 to e20, 4 days, solid; H: e19 to e20, 3 days, solid; B: e16 to e17, 5 days, solid; C: e17 to e18, 3 days, solid; D: e17 to e18, 2 days, solid; F: e18 to e19, 5 days, solid; I: e20 to e21, 4 days, solid.E (3 days)F (5 days)G (4 days)H (3 days)B (5 days)C (3 days)D (2 days)I (4 days)e16e17e18e19e20e21
(a)1 mark

Select the table recovered from the activity-on-arrow network

(b)1 mark

How many activities have no following activity?

(c)1 mark

Select the direct predecessor set for activity F