MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
Every Directed Acyclic Graph has at least one sink..
1.
Every Directed Acyclic Graph has at least one sink vertex.
A.
True
B.
False
Answer» B. False
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
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?
Which of the given statement is true?
What would be the output of the following C++ program if the given input is
What sequence would the BFS traversal of the given graph yield?
Which of the following is not a topological sorting of the given graph?
WHICH_OF_THE_GIVEN_STATEMENT_IS_TRUE??$
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?$
0 2 3 1 ?
If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply