Q101
Open questionConsider the following graph.
If b is the source vertex, what is the minimum cost to reach f vertex?
If b is the source vertex, what is the minimum cost to reach f vertex?
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
6/9
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionWhich of the following scientists didn't publish A* algorithm?
Select an option to see the answer and solution.
Q103
Open questionWhich of the following is the greedy best first search?
Select an option to see the answer and solution.
Q104
Open questionThe Bellmann Ford algorithm returns . . . . . . . . value.
Select an option to see the answer and solution.
Q105
Open questionHow many times the insert and extract min operations are invoked per vertex?
Select an option to see the answer and solution.
Q106
Open questionWhich of the following is false about Prim's algorithm?
Select an option to see the answer and solution.
Q107
Open questionWhat is the pseudo code to compute the shortest path in Dijkstra's algorithm?
Options are not available for this question.
Select an option to see the answer and solution.
Q108
Open questionWhat procedure is being followed in Floyd Warshall Algorithm?
Select an option to see the answer and solution.
Q109
Open questionWho published the B* search algorithm?
Select an option to see the answer and solution.
Q110
Open questionConsider the following graph. What is the minimum cost to travel from node A to node C?
Select an option to see the answer and solution.
Q111
Open questionKruskal's algorithm is best suited for the dense graphs than the prim's algorithm.
Select an option to see the answer and solution.
Q112
Open questionWhat will be the time complexity of the iterative depth first traversal code(V=no. of vertices E=no.of edges)?
Select an option to see the answer and solution.
Q113
Open questionWhich of the following is true?
Select an option to see the answer and solution.
Q114
Open questionBellmann ford algorithm provides solution for . . . . . . . . problems.
Select an option to see the answer and solution.
Q115
Open questionWhat is the time complexity of Dijikstra's algorithm?
Select an option to see the answer and solution.
Q116
Open questionPrim's algorithm is a . . . . . . . .
Select an option to see the answer and solution.
Q117
Open questionIf all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
Select an option to see the answer and solution.
Q118
Open questionWho described this Best First Search algorithm using heuristic evaluation rule?
Select an option to see the answer and solution.
Q119
Open questionDijkstra's Algorithm is the prime example for . . . . . . . .
Select an option to see the answer and solution.
Q120
Open questionIs Best First Search a searching algorithm used in graphs.
Select an option to see the answer and solution.