Precedence Tables (SQA National 5 Applications of Mathematics): Flashcards

Exam code: X844 75

1/8

0Still learning

Know0

  • Define precedence table.

Cards in this collection (8)

  • Define precedence table.

    A precedence table sets out every activity in a project, one to a row, together with what has to be finished before each one can begin.

    It is the starting point both for drawing an activity network and for working out how long the project must take.

  • Complete what a precedence table records:

    Each row is one activity, labelled by a letter, and the columns give a short description, the \_\_\_\_\_\_ activities that must come first, and the \_\_\_\_\_\_ that the activity takes.

    The completed sentence is:

    Each row is one activity, labelled by a letter, and the columns give a short description, the preceding activities that must come first, and the time that the activity takes.

    The time can be in any unit, so read the column heading before adding anything up.

  • How do you spot the starting activity in a precedence table?

    It is the activity with no preceding activities listed against it.

    You find it by looking down the preceding-activity column for the row that is empty, and it goes on the far left of the network.

  • True or False?

    An activity can have more than one preceding activity.

    True.

    An activity listed as preceded by C and I cannot begin until both of them are finished.

    This is what makes two separate routes through the network merge at that activity.

  • How do you spot the final activity in a precedence table?

    It is the activity that never appears in anyone else's list of preceding activities.

    This needs a different search from finding the start: instead of looking for an empty row, you scan the whole preceding-activity column for a letter that is missing from it.

  • How do you trace the routes through a precedence table?

    Begin at the starting activity, then look for an activity that lists it as a preceding activity.

    Carry on that way, each time finding an activity preceded by the one you have just reached, until you arrive at the final activity.

    Repeat from the start along each different branch until every route has been found.

  • True or False?

    The minimum time for a project is the time taken by the shortest route through the network.

    False.

    It is the longest route, because every activity has to be completed and the project is not finished until the slowest chain is done.

    The shorter routes simply run alongside it and finish with time to spare.

  • In a project G takes 20 minutes, B takes 3, D takes 20, C takes 15, A takes 5 and F takes 8. How long is the route G to B to D to C to A to F?

    The route takes 71 minutes.

    Adding the activity times straight along the route gives 20 + 3 + 20 + 15 + 5 + 8 = 71.

    Only the activities actually on the route are counted; anything on a different branch belongs to a different total.

Sign up to unlock flashcards

or