MARKING RUBRIC - Networks

STUDENT: __________________________

Networks

Q Item O1 O2 O3

1a.i. Route Identification and distance travelled 1 1

1a.ii. Route naming 1

1b. Apply Dijkstra’s algorithm 1 1

1c. Extend network diagram by adding extra links 1

1d. Apply Euler’s formula 2

1ei. Determine shortest distance 1 1

1eii Route Naming 1

2a. Identify Immediate Predecessors from Activity Diagram 1 1

2bi. Forward scan backward scan / backward scan 1 1

2bii Project Duration 1

2biii Critical Path 1 1

2ci. Crashing 1 2

2cii Cost calculation from Crashing 1

3a. Bipartite graph interpretation 1

3b. Bipartite graph analysis 1 1

3.c Bipartite graph allocations 1 1

4a. Adjacency matrix to network diagram 1 1

4b. Route identification 1 1

4c.i. Draw spanning tree 1

4cii Interpret spanning tree 2

4d. Euler trail Identification 1 1

5a. Apply Hungarian algorithm 1 1 1

5b. Calculate the minimum time 1

6a. Cut Capacity 1

6b. Cut Capacity showing calculations 2

6c. Cut Interpretation 2

6d. Maximum Flow 2

6e. How to Increase Flow for a Maximum 1 1

6f. How to Maximise flow with Minimal Cost 1 1

7a. Minimal Spanning Tree 1 1

7b. Calculation of minimal resources required from spanning tree 1

7c. Prim’s Algorithm interpretation 1 1

Total: /18 /20 /18

Outcome 1 Outcome 2 Outcome 3

Adjusted Score /5 /10 /5