GATE Overflow - Recent questions tagged graph-search
http://gateoverflow.in/tag/graph-search
Powered by Question2AnswerGATE1989-3-ixa
http://gateoverflow.in/87143/gate1989-3-ixa
<p>Answer the following:</p>
<p>Which one of the following statements (s) is/are FALSE?</p>
<ol style="list-style-type:upper-alpha">
<li>Overlaying is used to run a program, which is longer than the address space of the computer.</li>
<li>Optimal binary search tree construction can be performed efficiently by using dynamic programming.</li>
<li>Depth first search cannot be used to find connected components of a graph.</li>
<li>Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.</li>
</ol>DShttp://gateoverflow.in/87143/gate1989-3-ixaSun, 27 Nov 2016 19:13:43 +0000#Algorithm # DFS
http://gateoverflow.in/76936/%23algorithm-%23-dfs
Let G be a graph with n vertices and m edges.<br />
a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees?<br />
b. True or false: All its DFS forests will have the same number of tree edges and the same number of back edges?Algorithmshttp://gateoverflow.in/76936/%23algorithm-%23-dfsWed, 26 Oct 2016 15:21:41 +0000