Activity networks and precedence tables

Activity networks and precedence tables Flashcards

Spec 4.1–2 · Edexcel International A Level Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

13 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 13 cards
What is a precedence table?
A list of activities with their immediate predecessors (and durations).
What is an immediate predecessor?
An activity that must be finished directly before the given activity can start.
In an activity-on-arc network, what do arcs and nodes represent?
Arcs are activities; nodes are events (start or finish of activities).
How many start and finish events may a network have?
Exactly one of each.
When can an activity start?
When every activity arriving at its start event has finished.
What is a dummy activity?
A zero-duration dotted arrow, used to show dependence or to give unique event numbers.
Give the two uses of a dummy.
To show dependence correctly, and to ensure no two activities share both start and finish events.
What duration does a dummy have?
Zero.
Where do activities with no predecessors start?
At the start event.
Where do activities which nothing depends on finish?
At the single finish event.
C depends on A only; D depends on A and B. How is this drawn?
A and B end at different events; D starts at B's end event with a dummy from the end of A; C starts at A's end event.
A precedes C and C precedes F. What is F's entry in the table?
C only; A is not an immediate predecessor of F.
What is a redundant dummy?
One that can be removed without changing any dependence.

Flashcards