Continuing sort has time complexity of?
a) O(n)
b) O(n+k)
c) O(nlogn)
d) O(K)
Which sorting algorithm is faster?
a) O(n log n)
b) O n^2
c) O (n+k)
d) O n^3
Although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better than Kruskal's when the graph has a large number of vertices?
a) True
b) False
c) NA
d) NA
The difference between Prim s algorithm and Dijkstra’s s algorithm
is that Dijkstra’s s algorithm uses a same key?
a) True
b) False
c) NA
d) N/A
In the clique cover problem, for two vertices to be in the same group, they must be apart from each other?
a) True
b) False
c) NA
d) NA
In the clique cover problem, for two vertices to be in the same group, they must be.....each other.
a) Apart from
b) Far from
c) Near to
d) Adjacent to
