GATE CSE
First time here? Checkout the FAQ!
x
0 votes
106 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 (29.1k points)   | 106 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.4k 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 Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2734 Points

  5. Debashish Deka

    2592 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1342 Points

  9. Bikram

    1312 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,508 questions
26,832 answers
61,091 comments
23,146 users