Data Structure Directed Acyclic Graph Online Exam Quiz
Data Structure Directed Acyclic Graph GK Quiz. Question and Answers related to Data Structure Directed Acyclic Graph. MCQ (Multiple Choice Questions with answers about Data Structure Directed Acyclic Graph
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
Options
A : (V*(V-1))/2
B : (V*(V+1))/2
C : (V+1)C2
D : (V-1)C2
Which of the following is not a topological sorting of the given graph?
Options
A : A B C D E F
B : A B F E D C
C : A B E C F D
D : A B C D F E
What sequence would the BFS traversal of the given graph yield?
Options
A : A F D B C E
B : C B A F E D
C : A B D C E F
D : E F D C B A
Which of the given statement is true?
Options
A : All the Cyclic Directed Graphs have topological sortings
B : All the Acyclic Directed Graphs have topological sortings
C : All Directed Graphs have topological sortings
D : All the cyclic directed graphs hace non topological sortings
The topological sorting of any DAG can be done in ________ time.
Options
A : cubic
B : quadratic
C : linear
D : logarithmic
What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
Options
A : Depends on a Graph
B : Will always be zero
C : Will always be greater than zero
D : May be zero or greater than zero
If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
Options
A : Many Hamiltonian paths are possible
B : No Hamiltonian path is possible
C : Exactly 1 Hamiltonian path is possible
D : Given information is insufficient to comment anything
Every Directed Acyclic Graph has at least one sink vertex.
Options
A : True
B : False
C :
D :
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 :
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 Double Ended Queue