Q141
Open questionIdentify the correct Bellmann Ford Algorithm.
Options are not available for this question.
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
8/9
Page
Pick an option on a question to see the right answer and solution.
Q142
Open questionWhich of the following is an example of Best First Search algorithm?
Select an option to see the answer and solution.
Q143
Open questionPrim's algorithm is also known as . . . . . . . .
Select an option to see the answer and solution.
Q144
Open questionConsider the graph shown below.
Which of the following edges form the MST of the given graph using Prim'a algorithm, starting from vertex 4.
Which of the following edges form the MST of the given graph using Prim'a algorithm, starting from vertex 4.
Select an option to see the answer and solution.
Q145
Open questionConsider the following statements.
S1. Kruskal's algorithm might produce a non-minimal spanning tree.
S2. Kruskal's algorithm can efficiently implemented using the disjoint-set data structure.
S1. Kruskal's algorithm might produce a non-minimal spanning tree.
S2. Kruskal's algorithm can efficiently implemented using the disjoint-set data structure.
Select an option to see the answer and solution.
Q146
Open questionBellmann Ford Algorithm is an example for . . . . . . . .
Select an option to see the answer and solution.
Q147
Open questionWhat is the other name of the greedy best first search?
Select an option to see the answer and solution.
Q148
Open questionTime Complexity of Breadth First Search is? (V - number of vertices, E - number of edges)
Select an option to see the answer and solution.
Q149
Open questionWhich of the following traversal in a binary tree is similar to depth first traversal?
Select an option to see the answer and solution.
Q150
Open questionKruskal's algorithm is a . . . . . . . .
Select an option to see the answer and solution.
Q151
Open questionWhich of the following is a possible result of depth first traversal of the given graph(consider 1 to be source element)?
Select an option to see the answer and solution.
Q152
Open questionWhat is the running time of the Floyd Warshall Algorithm?
Select an option to see the answer and solution.
Q153
Open questionBellmann Ford Algorithm can be applied for . . . . . . . .
Select an option to see the answer and solution.
Q154
Open questionThe Breadth First Search traversal of a graph will result into?
Select an option to see the answer and solution.
Q155
Open questionWhich of the following data structure is used to implement DFS?
Select an option to see the answer and solution.
Q156
Open questionA 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?
Select an option to see the answer and solution.
Q157
Open questionConsider the given graph.
What is the weight of the minimum spanning tree using the Prim's algorithm,starting from vertex a?
What is the weight of the minimum spanning tree using the Prim's algorithm,starting from vertex a?
Select an option to see the answer and solution.
Q158
Open questionConsider a complete graph G with 4 vertices. The graph G has . . . . . . . . spanning trees.
Select an option to see the answer and solution.
Q159
Open questionBranch and bound is a . . . . . . . .
Select an option to see the answer and solution.
Q160
Open questionFloyd Warshall's Algorithm can be applied on . . . . . . . .
Select an option to see the answer and solution.