Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.

Related MCQs

• Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
• Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
• Prim’s algorithm can be efficiently implemented using            for graphs with greater density.
• Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
• The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
• Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
• Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
• Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm.
• Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
• In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.