What algorithmic technique does the kruskal algorithm follows?
a) Divide and conquer technique b) Dynamic programming c) Both a and b d) Greedy technique
Data Structures
Is kruskal algorithm is whether than prim’s algorithm?
a) yes b) no c) both are equal d) cannot determined
We need a data structure that maintains a _______.
a) Spanning tree b) Partition c) Flag d) Label D will appear here
Kruskal’s algorithm also finds the minimum cost spanning tree of a _____ by adding edges.
a) Weighted graph b) Graph c) Unweighted graph d) Label D will appear here
A “safe edge” is an edge of ____ which does not create a cycle.
a) Maximum weight b) No weight c) Constant weight d) Label D will appear here
From the following choose the one which belongs to the algorithm paradigm other than to which others from the following belongs to.
a) Minimum & maximum problem b) Knapsack problem c) Selection problem d) Quick sort
In _______ operations method incident edges is called once for each vertex.
a) Tree b) Stack c) Graph d) Hash
In prims algorithm process is repeated until a ____ is formed.
a) Spanning tree b) Vertex c) Flag d) High
_______ finds a minimum cost spanning tree by selecting edges from the graph.
a) Prim’s algorithm b) Kruskal algorithm c) Jarnik algorithm d) Analysis and algorithm
Prims algorithm start at a source vertex and grow a ______.
a) Two trees b) Single tree c) Multiple tree d) Tree set