Menu

Question Discussion & Solution

MCQ
Q.
Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

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.
In a Binary Decision Diagram, how many types of terminal exists?
forum Discussion
MCQ
2.
Breadth first search __________
forum Discussion
MCQ
3.
Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
forum Discussion
MCQ
4.
Which method of traversal does not use stack to hold nodes that are waiting to be processed?
forum Discussion
MCQ
5.
A graph with all vertices having equal degree is known as a __________
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