GATE CSE
First time here? Checkout the FAQ!
x
0 votes
172 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 (30.4k points)  
retagged by | 172 views

1 Answer

0 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.5k 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


Top Users Jul 2017
  1. Bikram

    4910 Points

  2. manu00x

    2940 Points

  3. Debashish Deka

    1870 Points

  4. joshi_nitish

    1776 Points

  5. Arjun

    1506 Points

  6. Hemant Parihar

    1306 Points

  7. Shubhanshu

    1128 Points

  8. pawan kumarln

    1124 Points

  9. Arnab Bhadra

    1114 Points

  10. Ahwan

    956 Points


24,099 questions
31,074 answers
70,703 comments
29,407 users