edited by
3,999 views
14 votes
14 votes

Which one of the following statements (s) is/are FALSE?

  1. Overlaying is used to run a program, which is longer than the address space of the computer.
  2. Optimal binary search tree construction can be performed efficiently by using dynamic programming.
  3. Depth first search cannot be used to find connected components of a graph.
  4. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
edited by

3 Answers

17 votes
17 votes
  1. FALSE according to definition of address space given in the link. whatever memory used by the overlay comes under the address space of computer "https://en.wikipedia.org/wiki/Address_space".
  2. TRUE Optimal binary search tree construction can be performed efficiently by using dynamic programming.
    ref: http://www.geeksforgeeks.org/dynamic-programming-set-24-optimal-binary-search-tree/
  3. FALSE Depth first search can be used to find connected components of a graph.
  4. FALSE Infix + (postfix or prefix) is req. to construct the binary tree uniquely.
edited by
0 votes
0 votes
Answer = A,C,D

A,C,D options are false.

While option B is true

as Optimal binary search tree construction can be performed efficiently using dynamic programming.
Answer:

Related questions

18 votes
18 votes
7 answers
1
makhdoom ghaya asked Nov 27, 2016
3,594 views
Which of the following well-formed formulas are equivalent?$P \rightarrow Q$$\neg Q \rightarrow \neg P$$\neg P \vee Q$$\neg Q \rightarrow P$
26 votes
26 votes
2 answers
2
32 votes
32 votes
8 answers
3
makhdoom ghaya asked Nov 27, 2016
11,829 views
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation