51. Which data structure is most suitable for implementing best first branch and bound strategy?
52. The time taken to compute the transitive closure of a graph is Theta(n2).
53. In BFS, how many times a node is visited?
54. 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]\]
55. Which of the following is not a branch and bound strategy to generate branches?
56. 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)
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)57. Which of the following is false?
58. What approach is being followed in Floyd Warshall Algorithm?
59. What is the basic principle behind Bellmann Ford Algorithm?
60. Which of the following is not the algorithm to find the minimum spanning tree of the given graph?
Read More Section(Graph Algorithms (DFS, BFS, Dijkstras, etc))
Each Section contains maximum 100 MCQs question on Graph Algorithms (DFS, BFS, Dijkstras, etc). To get more questions visit other sections.