Question: 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?

Options

A : True

B : False

C :

D :

Click to view Correct Answer

Previous ||

Data Structure Directed Acyclic Graph more questions

For a matrix A of order n, the det(adj(A)) =....

For a second order reaction, the rate is proportional to....

For any array, given that at most one element is....

For any given sequence, there will ALWAYS be a unique....

For any point on any curve there exist two normals.

For continuous random variables, the CDF is the derivative of....

For controlling the amount of water in cement regular moisture....

For determining the concentration of dust, continuous sampling is carried....

For digital signatures private key cryptosystem is used.

For every rod cutting problem there will be a unique....

Data Structure Adjacency List more Online Exam Quiz

Data Structure Coin Change Problem

Data Structure Counting Boolean Parenthesizations

Data Structure Depth First Search

Data Structure Dice Throw Problem

Data Structure Direct Addressing Tables

Data Structure Directed Graph

Data Structure Double Ended Queue

Data Structure Doubly Linked Lists

Data Structure Dynamic Array

Data Structure Dynamic Programming