UGC-NET | UGC NET CS 2017 Jan – II | Question 25

Which of the following statements is false ?
(A) Optimal binary search tree construction can be performed efficiently using dynamic programming.
(B) Breadth-first search cannot be used to find connected components of a graph.
(C) Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely.
(D) Depth-first-search can be used to find the connected components of a graph.
(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation: (A) Optimal binary search tree construction can be performed efficiently using dynamic programming.
(B) Breadth-first search cannot be used to find connected components of a graph.
(C) Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely.
(D) Depth-first-search can be used to find the connected components of a graph.
All statements are correct except (B) because BFS can be used to check connectivity of graphs.
So, option (B) is correct.

Quiz of this Question