Can someone explain question 5 on NETWROKS (maths exam), I got 4 but can't get question5. ALSO question6 netwroks please, i looked at the solutions but it still doesn't make sense, how do i handle these types of questions
Thanks
Questions 5 essentially asks the number of activities on the critical path(s). If you complete forward and backward scanning on the activity network for the question, you will find that activities C-F-H-M have the same EST and LST, and thus are on the only critical path. As any activity on the critical path cannot be delayed without increasing the project's minimum time, and that there are four activities on the critical path, the answer is 4 (C).
Question 6 made me muck up a few times. A good way to approach this question is to label the degree of each vertex, and it will result in the top, centre, and bottom two vertices being odd, making a total of four odd vertices. The question asks how many ways an edge can be removed to make an Eulerian trail. An Eulerian trail can only occur if there are two odd vertices. Removing any edge connecting two odd vertices will decrease their vertex to an even. (For example, removing the edge between the top vertex and centre vertex will decrease their vertex to 2 and 4 respectively). This will result in only two odd vertices left, allowing for an Eulerian trail to occur. In the graph, there are five edges connecting only the odd degree vertices, therefore there are 5 ways (E) to remove an edge for an Eulerian trail to be possible.