Home · Unit 4 · Topic 4

Topic 4: Networks and decision mathematics 1

Trees and minimum connector problems

4 hours

• Understand the meaning of tree, spanning tree and minimum spanning tree. 1 interactive
• Determine a minimum spanning tree in a weighted connected graph. 1 interactive
• Solve practical problems involving minimum spanning trees, e.g. minimising the length of cable needed to provide power from a single power station to substations in several towns.

Project planning and scheduling using critical path analysis (CPA)

8 hours

• Construct a project network diagram (activity on arc) to represent the durations and interdependencies of activities that must be completed during the project (excluding dummy activities).
• Use forward and backward scanning to determine the earliest starting time (EST) and latest starting time (LST) for each activity in the project. 1 interactive
• Use ESTs and LSTs to locate the critical path/s for a project.
• Use the critical path to determine the minimum time for a project to be completed.
• Calculate float times for non-critical activities.
• Solve small-scale practical problems involving critical path analysis.