Menu

Question Discussion & Solution

MCQ
Q.
Time complexity to find if there is an edge between 2 particular vertices 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.
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to
forum Discussion
MCQ
2.
From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
forum Discussion
MCQ
3.
A graph having an edge from each vertex to every other vertex is called a ___________
forum Discussion
MCQ
4.
The spanning tree of connected graph with 10 vertices contains ..............
forum Discussion
MCQ
5.
In a Binary Decision Diagram, how many types of terminal exists?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward