adplus-dvertising
frame-decoration

Question

The Depth First Search traversal of a graph will result into?

a.

Linked List

b.

Tree

c.

Graph with back edges

d.

None of the mentioned

Answer: (b).Tree

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The Depth First Search traversal of a graph will result into?

Similar Questions

Discover Related MCQs

Q. A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

Q. What can be the applications of Depth First Search?

Q. When the Depth First Search of a graph is unique?

Q. Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)

Q. In Depth First Search, how many times a node is visited?

Q. Breadth First Search is equivalent to which of the traversal in the Binary Trees?

Q. Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

Q. The Breadth First Search traversal of a graph will result into?

Q. A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

Q. What can be the applications of Breadth First Search?

Q. When the Breadth First Search of a graph is unique?

Q. Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)

Q. In BFS, how many times a node is visited?

Q. Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

Q. What is the maximum number of edges in a bipartite graph having 10 vertices?

Q. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

Q. The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.

(A) O(n)
(B) O(m)
(C) O(m + n)
(D) O(mn)

Q. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________