How is the time complexity of BFS affected when the graph is represented using an adjacency matrix?
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
3/9
Page
Pick an option on a question to see the right answer and solution.
Which of the following properties is essential for the efficient implementation of Dijkstra's algorithm?
Select an option to see the answer and solution.
In a graph with weights, which algorithm helps in constructing a Minimum Spanning Tree (MST)?
Select an option to see the answer and solution.
Which traversal algorithm can be used to check if a graph is bipartite?
Select an option to see the answer and solution.
What is a characteristic feature of a Biconnected Graph?
Select an option to see the answer and solution.
Prim's algorithm can be efficiently implemented using . . . . . . . . for graphs with greater density.
Select an option to see the answer and solution.
Which of the following is the most commonly used data structure for implementing Dijkstra's Algorithm?
Select an option to see the answer and solution.
Time Complexity of DFS is? (V - number of vertices, E - number of edges)
Select an option to see the answer and solution.
Who proposed the modern formulation of Floyd-Warshall Algorithm as three nested loops?
Select an option to see the answer and solution.
Which of the following branch and bound strategy leads to breadth first search?
Select an option to see the answer and solution.
Which data structure is most suitable for implementing best first branch and bound strategy?
Select an option to see the answer and solution.
The time taken to compute the transitive closure of a graph is Theta(n2).
Select an option to see the answer and solution.
In BFS, how many times a node is visited?
Select an option to see the answer and solution.
Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
{\text{M}} = \left[ {\begin{array}{*{20}{c}} 0&1&1 \\ 1&0&1 \\ 1&1&0 \end{array}} \right]
{\text{M}} = \left[ {\begin{array}{*{20}{c}} 0&1&1 \\ 1&0&1 \\ 1&1&0 \end{array}} \right]
Select an option to see the answer and solution.
Which of the following is not a branch and bound strategy to generate branches?
Select an option to see the answer and solution.
Complete the program.
n=rows[W]
D(0)=W
for k=1 to n
do for i=1 to n
do for j=1 to n
do ___________ return D(n)Select an option to see the answer and solution.
Which of the following is false?
Select an option to see the answer and solution.
What approach is being followed in Floyd Warshall Algorithm?
Select an option to see the answer and solution.
What is the basic principle behind Bellmann Ford Algorithm?
Select an option to see the answer and solution.
Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
Select an option to see the answer and solution.