Top 50+ Solved Non Linear Data Structures - Graphs MCQ Questions Answer
Q. How many of the following statements are correct?
a. All cyclic graphs are complete graphs.
b. All complete graphs are cyclic graphs.
c. All paths are bipartite.
d. All cyclic graphs are bipartite.
Q. What would the time complexity to check if an undirected graph with V vertices and E edges isBipartite or not given its adjacency matrix?
a. O(E*E)
b. O(V*V)
c. O(E)
d. O(V)
Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
a. (V*(V-1))/2
b. (V*(V+1))/2
c. (V+1)C2
d. (V-1)C2
Q. The topological sorting of any DAG can be done in time.
a. cubic
b. quadratic
c. linear
d. logarithmic
Q. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
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
Q. Which of the given statement is true?
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 have non topological sortings
Q. What is the value of the sum of the minimum in-degree and maximum out-degree of an DirectedAcyclic Graph?
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