home AS/A2 d1 AS/A2

D1 Summary
True or false? backmore
Check some facts on this module by completing this true-false test. You can only Reset the scores once you have correctly answered all 10.
Correct: Attempts: % Correct:
1 Quick Sort Algorithm may only be used to sort a list of words not a list of numbers
True False
2 There may be more than one shortest path between two vertices of a graph
True False
3 An optimal tableau has no negative elements in the profit row
True False
4 In an activity network vertices represent activities
True False
5 When using Prim's Algorithm you need to check for cycles
True False
6 If a minimum spanning tree for a connected network has n edges then the network has n+1 vertices
True False
7 A graph can only have an odd number of odd vertices
True False
8 It is not always possible to find a complete matching
True False
9 A minimum cut crosses saturated edges
True False
10 First Fit Decreasing Algorithm is guaranteed to find an optimal solution
True False

JavaScript interactive pages © MathsNet 2004