Content • Construct an activity chart to represent a particular project. • Draw a network diagram to represent the activities to be completed during a project. • Use critical path analysis to determine the minimum time for a project to be completed. • Use forward and backward scanning to determine the earliest starting times (EST) and latest starting times (LST) for each activity in a project. • Calculate float times of non-critical activities. • Use ESTs and LSTs to locate the critical path for the project. • Solve small-scale network flow problems. • Use the ‘maximum-flow minimum-cut’ theorem to solve a flow problem. • Convert information presented in a table into a network diagram. • Determine the flow capacity of a network.