Networks and Decision Making Techniques

To find the earliest starting time, in hours, for activity N which method do you use

• Prim's Algorithm

• Forward Scanning

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Hungarian Algorithm

To complete the project in minimum time, some activities cannot be delayed. To find the number of activities that cannot be delayed which technique do you use

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

If each child starts their allocated job at the same time, then the first child to finish could be found by using which technique?

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

Which technique can you use to answer this question?

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

What technique can you use to answer

"What is the shortest distance, in kilometres, covered in training program 1?"

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

What technique can you use to answer

"What is the maximum flow from S to O, in number of people per minute?"

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

What technique can you use to answer

"Name the four activities that have a float time of at least one month."

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

What technique can you use to answer

"When this project is completed in the minimum time, the sum of all the float times, in days, will be"

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)

A directed network for this project will require a dummy activity.

The dummy activity will be drawn from the end of

• activity A to the start of activity D.

• activity E to the start of activity F.

• activity F to the start of activity I

• activity G to the start of activity H.

• activity I to the start of activity J.

What technique can you use to answer

"What is the maximum flow of stormwater, in litres per minute, from the source to the sink?"

• Prim's Algorithm

• Hungarian Algorithm

• Minimum Cut - Maximum Flow

• Dijkstra's Algorithm

• Critical Path Analysis (Forward scanning and backward scanning)