24 August, 2018

Critical Paths


(a)State four applications of network models

- Banking sector.
- Transport sector.
- Business management sector.
- Used in technology sector.
- Cash management.

(b)Differentiate between directed and undirected paths and outline the shortest path algorithm for network problems
The difference between the two pairs is that directed paths have vertices with an order of how the paths between the vertices connect between each of them. While undirected paths where the parts vertices are in unordered form. The vertices do not have a direction on how to connect which each other their connect with each other in a random way.
The shortest path algorithm for network problems solves the problem encountered in networks by using algorithms which focuses on computing the shortest path between the vertices. Once the shortest paths is found it is then chosen to be used to reach the objective of the project. This method is well suited in financial institutions and also the transport sector because the shortest distance will be well appreciated so as to cut cost and also distance.

(c)A project has been broken down into 10 activities with the following predecessors and duration
 
Draw the network diagram and identify the critical path



The critical path is the one I marked using the green-yellow color which is 20 days and goes through A, F and G.

No comments:

Post a Comment