Menu

Question Discussion & Solution

MCQ
Q.
The output of Kruskal and Prims algorithm is ________________

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________
forum Discussion
MCQ
2.
In the case of Fibnocci heap the running time of Prim
forum Discussion
MCQ
3.
. Identify the correct problem for multistage graph from the list given below.
forum Discussion
MCQ
4.
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
forum Discussion
MCQ
5.
. Breadth first search uses __________ as an auxiliary structure to hold nodes for future processing.
forum Discussion

category More Design and Analysis of Algorithms Topics

article

Design and Analysis of Algorithms Basics

format_list_bulleted 76 MCQs
article

Asymptotic Notation

format_list_bulleted 38 MCQs
article

Divide and Conquer Strategy

format_list_bulleted 18 MCQs
article

Sorting

format_list_bulleted 14 MCQs
article

Linear Time Sorting

format_list_bulleted 8 MCQs
article

Dynamic Programming

format_list_bulleted 18 MCQs
article

Greedy Algorithms

format_list_bulleted 10 MCQs
article

Backtracking Algorithms

format_list_bulleted 13 MCQs
article

Graphs

format_list_bulleted 18 MCQs
article

Complexity Theory

format_list_bulleted 11 MCQs