Menu

Question Discussion & Solution

MCQ
Q.
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 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.
. Identify the correct problem for multistage graph from the list given below.
forum Discussion
MCQ
2.
The column sum in an incidence matrix for a simple graph is __________
forum Discussion
MCQ
3.
Graph traversal is different from a tree traversal, because:
forum Discussion
MCQ
4.
The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is
forum Discussion
MCQ
5.
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

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