Lab Tasks
Exam Style Questions
- Give the algorithm for finding a topological ordering of the nodes
of an activity-on-vertex network.
- Give a toplogical ordering of the nodes of this activity-on-vertex
network.
[Picture of some graph, make up your own :-]
- Describe a data structure can be used to implement the algorithm
for finding a topological ordering of the nodes of an activity-on-vertex
network in O(n+e) time.
Explain how the data structure is used.
- Below is the algorithm for finding a topological ordering of the nodes
of an activity-on-vertex network.
Derive, using using step counts or reasonable explanation, the asymptotic
complexity of this algorithm.
- Compute the {e,l,ee,el} values for this activity-on-edge network.
[Picture of some graph, make up your own :-]
- Given the following ee and ll values for this graph, determine the
e and l values, and say which activities are critical.
[Picture of some graph, make up your own :-]