Q121
Open questionPrim's algorithm resembles Dijkstra's algorithm.
Select an option to see the answer and solution.
Data Structure · all questionsGraph Algorithms (DFS, BFS, Dijkstras, etc)
Graph Algorithms (DFS, BFS, Dijkstras, etc)
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
167
Questions
7/9
Page
Pick an option on a question to see the right answer and solution.
Q122
Open questionWhat is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Select an option to see the answer and solution.
Q123
Open questionWorst case is the worst case time complexity of Prim's algorithm if adjacency matrix is used?
Select an option to see the answer and solution.
Q124
Open questionWhich algorithm is used in graph traversal and path finding?
Select an option to see the answer and solution.
Q125
Open questionBreadth First Search is equivalent to which of the traversal in the Binary Trees?
Select an option to see the answer and solution.
Q126
Open questionRegarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
Select an option to see the answer and solution.
Q127
Open questionFloyd Warshall algorithm was proposed by . . . . . . . .
Select an option to see the answer and solution.
Q128
Open questionThe Depth First Search traversal of a graph will result into?
Select an option to see the answer and solution.
Q129
Open questionWhat is the time complexity of Kruskal's algorithm?
Select an option to see the answer and solution.
Q130
Open questionWhich of the following is false in the case of a spanning tree of a graph G?
Select an option to see the answer and solution.
Q131
Open questionGiven pseudo code of Dijkstra's Algorithm.
//Initialise single source(G,s)
S=0
Q=V[G]
While Q != 0
Do u=extract-min(Q)
S=S union {u}
For each vertex v in adj[u]
Do relax(u,v,w)Select an option to see the answer and solution.
Q132
Open questionEvery graph has only one minimum spanning tree.
Select an option to see the answer and solution.
Q133
Open questionIn Depth First Search, how many times a node is visited?
Select an option to see the answer and solution.
Q134
Open questionWhat happens when the value of k is 0 in the Floyd Warshall Algorithm?
Select an option to see the answer and solution.
Q135
Open questionWhich of the following branch and bound strategy leads to depth first search?
Select an option to see the answer and solution.
Q136
Open questionWhat is running time of Dijkstra's algorithm using Binary min- heap method?
Select an option to see the answer and solution.
Q137
Open questionWhich of the following data structure is used to implement BFS?
Select an option to see the answer and solution.
Q138
Open questionDijkstra's Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
Select an option to see the answer and solution.
Q139
Open questionKruskal's algorithm is best suited for the sparse graphs than the prim's algorithm.
Select an option to see the answer and solution.
Q140
Open questionIn the given graph, identify the path that has minimum cost to travel from node a to node f.
Select an option to see the answer and solution.