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.
What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?
forum Discussion
MCQ
2.
What is the degree sequence of the given HyperGraph, in non-increasing order.V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}
forum Discussion
MCQ
3.
A
forum Discussion
MCQ
4.
The Breadth First Search traversal of a graph will result into?
forum Discussion
MCQ
5.
In a graph if e=[u, v], Then u and v are called
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs