in Education by
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? (a) True (b) False Select the correct answer from above options Data Structures and Algorithms questions and answers

1 Answer

0 votes
by
 
Best answer
Correct option is (b) False Best explanation: If such vertices exists it means that the graph contains a cycle which contradicts the first part of the statement.

Related questions

0 votes
    Consider you have an array of some random size. You need to perform dequeue operation. You can perform ... from above options Data Structures and Algorithms questions and answers...
asked Nov 14, 2021 in Education by JackTerrance
0 votes
    The actual pairing heap implementation uses the right child and left child representation. (a) true (b) ... from above options Data Structures and Algorithms questions and answers...
asked Nov 14, 2021 in Education by JackTerrance
0 votes
0 votes
    Your organization has a website where visitors randomly receive one of two coupons. It is also possible that ... their purchase decisions. Which analysis method should you use?...
asked Apr 27, 2021 in Technology by JackTerrance
...