Skip to content
Back to quiz
6. The total float is....
- A path from the source node to the sink node which entirely follows the critical activities.
- A matching where the number of arcs is as large as possible.
- The amount of time a project can be delayed by.
- The amount of time a project can be delayed by without affecting the duration of the project.
- The things that will prevent you from using or making and infinite number of each of the variables.
7. In a Semi-Eularian graph precisely two valances are odd.
8. A walk is...
- A closed path i.e the end vertex of the last edge is the start vertex of the first edge.
- A path in which you are permitted to return to a vertex more than once.
- Part of the original graph.
- An edge that starts and finishes at the same vertex.
- A connected graph with no cycles.
9. An Adjacency matrix....
- Records the number of direct links between vertices.
- Records the number of verticies adjacent to the primary vertex.
- Is a made up word.
- Records the weights on each edge.
- Can be used to find a minnimum spanning tree using prims algorithm.
10. A maximal matching is....
- Consists of two sets of vertices X and Y where the edges only join vertices in X to vertices in Y, not vertices within a set.
- A graph in which every vertex is directly connected by an edge to each of the other vertices.
- A matching where the number of arcs is as large as possible.
- The aim of the problem.
- The one to one pairing of some or all of the elements of one set X to a second set Y.