Qn 1. Paths
Qn 1. Max Flow
Qn 1. Hungarian
Qn 1. Dijkstra
Qn 1. Prim's
Qn 2 Precedence Tables
Qn 3 Scanning
Qn 3 Critical Paths
Qn 3 Crashing 1
Qn 3 Crashing 2
Solutions
Question 2: Flow Diagrams
Question 3: Hungarian Algorithm
Question 4: Activity Tables/Minimal Job Completion Time