GATE CSE
First time here? Checkout the FAQ!
x
0 votes
124 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.2k points)   | 124 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 Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arunav Khare

    1464 Points

  10. Arjun

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,062 answers
63,294 comments
24,160 users