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

View solution

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)

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

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)

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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)

View solution

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

View solution