GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
232 views

Answer the following:

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.
asked in DS by Veteran (38.7k points)  
retagged by | 232 views
what is overlaying concept???

1 Answer

+2 votes

A. 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".

B. 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/

C. FLASE Depth first search can be used to find connected components of a graph.

D. FALSE Infix + (postfix or prefix) is req. to construct the binary tree uniquely.

answered by Boss (9.8k points)  
i think first is also true as we use overlay to run programms that can't fit completely in memory at the same time hence we swap parts of program
yes I too think A) and B) both true


Top Users Sep 2017
  1. Habibkhan

    6334 Points

  2. Warrior

    2202 Points

  3. Arjun

    2150 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1706 Points

  8. makhdoom ghaya

    1650 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points


25,978 questions
33,554 answers
79,344 comments
31,011 users