Menu

Question Discussion & Solution

MCQ
Q.
If the graph is represented as an adjacency matrix then the time complexity of Kruskal

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.
Read the following statements carefully and pick the correct option:

 I. The worst time complexity of the Floyd
forum Discussion
MCQ
2.
A graph is said to be
forum Discussion
MCQ
3.
For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.
forum Discussion
MCQ
4.
For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
forum Discussion
MCQ
5.
Graph Structured Stack finds its application in _____________
forum Discussion

category More Design and Analysis of Algorithms Topics

article

Design and Analysis of Algorithms Basics

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Asymptotic Notation

format_list_bulleted 38 MCQs
Practice arrow_forward
article

Divide and Conquer Strategy

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Sorting

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Linear Time Sorting

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Dynamic Programming

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Greedy Algorithms

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Backtracking Algorithms

format_list_bulleted 13 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Complexity Theory

format_list_bulleted 11 MCQs
Practice arrow_forward