T3W8 Short Path, Min Span Trees, Flow, Match, Scheduling

What type of graph is this?

• Activity network

• Spanning Tree

• Bipartite Graph

• Directed, weighted graph

• Complete graph

What is the first step in the Hungarian Algorithm to solve this matching problem?

• Subtract the smallest uncovered value from all the others

• Subtract the smallest value in each column from all the others in the column

• Subtract the smallest value in each row from all the others in the row

• Add vertical and horizontal lines to cover all the 0's

• Draw a bipartite graph from the table

Which task should be allocated to Andrew?

• Publicity

• Finances

• Equipment

• Catering

• There are multiple tasks that could go to Andrew

How many dummy activities are present in this activity network?

• 0

• 1

• 2

• 3

• 4 or more

How many direct predecessors does activity N have?

• 0

• 1

• 2

• 3

• 4 or more

The number of activities that have 2 immediate predecessors is:

• 0

• 1

• 2

• 3

• 4 or more

The number of activities that have 2 immediate predecessors is:

• 0

• 1

• 2

• 3

• 4 or more

In a precendence table, the Row for activity G would have

• Nothing as predecessor

• H and J as predecessor

• C and E as predecessor

• E as predecessor

• B and E as predecessor

The flow is listed as litres / minute.

The maximum flow from source to sink is:

• 55

• 52

• 48

• 90

• It cannot be determined

The flow from source to sink through this cut is:

• 50

• 85

• 135

• 115

• This is not a valid cut